Sciweavers

APPROX
2010
Springer
139views Algorithms» more  APPROX 2010»
13 years 6 months ago
Two-Source Extractors Secure against Quantum Adversaries
We initiate the study of multi-source extractors in the quantum world. In this setting, our goal is to extract random bits from two independent weak random sources, on which two q...
Roy Kasher, Julia Kempe
ESOP
2008
Springer
13 years 6 months ago
Ranking Abstractions
Abstractions Aziem Chawdhary1 , Byron Cook2 , Sumit Gulwani2 , Mooly Sagiv3 , and Hongseok Yang1 1 Queen Mary, University of London 2 Microsoft Research 3 Tel Aviv University Abstr...
Aziem Chawdhary, Byron Cook, Sumit Gulwani, Mooly ...
FIWAC
1993
152views Cryptology» more  FIWAC 1993»
13 years 9 months ago
Disjoint Systems (Extended Abstract)
Systems (Extended Abstract) Noga Alon ∗ Benny Sudakov Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv University, Tel Aviv, Israel A dis...
Noga Alon, Benny Sudakov
RANDOM
2001
Springer
13 years 9 months ago
Near-optimum Universal Graphs for Graphs with Bounded Degrees
d Abstract) Noga Alon1, , Michael Capalbo2, , Yoshiharu Kohayakawa3, , Vojtˇech R¨odl4,† , Andrzej Ruci´nski5,‡ , and Endre Szemer´edi6,§ 1 Department of Mathematics, Raym...
Noga Alon, Michael R. Capalbo, Yoshiharu Kohayakaw...
COMPGEOM
2010
ACM
13 years 10 months ago
Incidences in three dimensions and distinct distances in the plane
d Abstract] György Elekes Eötvös University Micha Sharir Tel Aviv University and New York University We first describe a reduction from the problem of lower-bounding the numbe...
György Elekes, Micha Sharir
STOC
2003
ACM
117views Algorithms» more  STOC 2003»
14 years 5 months ago
Distinct distances in three and higher dimensions
Improving an old result of Clarkson et al., we show that the number of distinct distances determined by a set P of n points in three-dimensional space is (n77/141) = (n0.546 ), fo...
Boris Aronov, János Pach, Micha Sharir, G&a...
STOC
2007
ACM
137views Algorithms» more  STOC 2007»
14 years 5 months ago
Testing k-wise and almost k-wise independence
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
Noga Alon, Alexandr Andoni, Tali Kaufman, Kevin Ma...