102 search results - page 4 / 21 » Improved Bounds for Geometric Permutations |
STOC
2001
ACM
15 years 9 months ago
2001
ACM
We show how to bound the mixing time and log-Sobolev constants of Markov chains by bounding the edge-isoperimetry of their underlying graphs. To do this we use two recent techniqu...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...
FSE
2010
Springer
15 years 24 days ago
2010
Springer
This paper provides a unified framework for improving PRF (pseudorandom function) advantages of several popular MACs (message authentication codes) based on a blockcipher modeled a...
81
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
This work investigates a geometric approach to proving cell probe lower bounds for data structure problems. We consider the approximate nearest neighbor search problem on the Bool...