3228 search results - page 438 / 646 » Computationally Sound Proofs |
132
Voted
STOC
2003
ACM
16 years 3 months ago
2003
ACM
Random regular graphs play a central role in combinatorics and theoretical computer science. In this paper, we analyze a simple algorithm introduced by Steger and Wormald [10] and...
119
Voted
STOC
2002
ACM
16 years 3 months ago
2002
ACM
The collision problem is to decide whether a function X : {1, . . . , n} {1, . . . , n} is one-to-one or two-to-one, given that one of these is the case. We show a lower bound of...
138
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
We present new results on Cartesian trees with applications in range minimum queries and bottleneck edge queries. We introduce a cache-oblivious Cartesian tree for solving the ran...
116
click to vote
ICSE
2007
IEEE-ACM
16 years 3 months ago
2007
IEEE-ACM
We present a spreadsheet debugger targeted at end users. Whenever the computed output of a cell is incorrect, the user can supply an expected value for a cell, which is employed b...
188
Voted
Publication
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first ...