1806 search results - page 161 / 362 » Randomness and halting probabilities |
195
click to vote
EUROCRYPT
2005
Springer
16 years 5 days ago
2005
Springer
We prove, under the strong RSA assumption, that the group of invertible integers modulo the product of two safe primes is pseudo-free. More specifically, no polynomial time algor...
160
click to vote
ICALP
2005
Springer
16 years 5 days ago
2005
Springer
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
172
click to vote
FSTTCS
2004
Springer
16 years 1 days ago
2004
Springer
We consider the problem of determining whether a given set S in Rn is approximately convex, i.e., if there is a convex set K ∈ Rn such that the volume of their symmetric differe...
156
click to vote
PODC
2003
ACM
15 years 12 months ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
142
click to vote
ESA
2003
Springer
15 years 12 months ago
2003
Springer
We present a new finger search tree with O(1) worst-case update time and O(log log d) expected search time with high probability in the Random Access Machine (RAM) model of comput...