102 search results - page 1 / 21 » Improved Bounds for Geometric Permutations |
63
Voted
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
74
Voted
CCCG
2001
14 years 11 months ago
2001
We study combinatorial bounds for geometric permutations of balls with bounded size disparity in d-space. Our main contribution is the following theorem: given a set S of n disjoi...
FSE
2008
Springer
14 years 11 months ago
2008
Springer
HCTR was proposed by Wang, Feng and Wu in 2005. It is a mode of operation which provides a tweakable strong pseudorandom permutation. Though HCTR is quite an efficient mode, the au...
FFA
2010
14 years 8 months ago
2010
We develop new coset bounds for algebraic geometric codes. The bounds have a natural interpretation as an adversary threshold for algebraic geometric secret sharing schemes and le...
101
click to vote
STOC
2004
ACM
15 years 9 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...