562 search results - page 19 / 113 » Simple Randomized Algorithms for Closest Pair Problems |
128
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...
129
click to vote
JOC
2002
15 years 2 months ago
2002
We present a polynomial-time algorithm that provably recovers the signer's secret DSA key when a few bits of the random nonces k (used at each signature generation) are known ...
108
Voted
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
119
Voted
STOC
1994
ACM
15 years 6 months ago
1994
ACM
Let G(3n, p, 3) be a random 3-colorable graph on a set of 3n vertices generated as follows. First, split the vertices arbitrarily into three equal color classes and then choose ev...
111
click to vote
ASIACRYPT
2001
Springer
15 years 7 months ago
2001
Springer
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...