95
Voted
CAV
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We describe a method for synthesizing reasonable underapproximations to weakest preconditions for termination--a long-standing open problem. The paper provides experiment...
102
Voted
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
We show that, in the ideal-cipher model, triple encryption (the cascade of three independently-keyed blockciphers) is more secure than single or double encryption, thereby resolvin...
88
Voted
STOC
2003
ACM
16 years 16 days ago
2003
ACM
We study novel combinatorial properties of graphs that allow us to devise a completely new approach to dynamic all pairs shortest paths problems. Our approach yields a fully dynam...
74
Voted
STOC
2003
ACM
16 years 16 days ago
2003
ACM
We show that n lines in 3-space can be cut into O(n2-1/69 log16/69 n) pieces, such that all depth cycles defined by triples of lines are eliminated. This partially resolves a long...
113
Voted
CADE
2008
Springer
16 years 17 days ago
2008
Springer
Abstract. Conjunctive query answering plays a prominent role in applications of description logics (DLs) that involve instance data, but its exact complexity was a long-standing op...