Amnon Ta-Shma
Tel Aviv University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Amnon Ta-Shma.
SIAM Journal on Discrete Mathematics | 2000
Jaikumar Radhakrishnan; Amnon Ta-Shma
We show that the size of the smallest depth-two
symposium on the theory of computing | 2001
Amnon Ta-Shma; Christopher Umans; David Zuckerman
N
Journal of the ACM | 2002
Andris Ambainis; Ashwin Nayak; Amnon Ta-Shma; Umesh V. Vazirani
-superconcentrator is
symposium on the theory of computing | 2000
Sean Hallgren; Alexander Russell; Amnon Ta-Shma
symposium on the theory of computing | 2000
Dorit Aharonov; Amnon Ta-Shma; Umesh V. Vazirani; Andrew Chi-Chih Yao
\Theta(N\log^2 N/\log\log N).
IEEE Transactions on Information Theory | 2004
Amnon Ta-Shma; D. Zuckerman
symposium on the theory of computing | 2001
Hartmut Klauck; Ashwin Nayak; Amnon Ta-Shma; David Zuckerman
Before this work, optimal bounds were known for all depths except two. For the upper bound, we build superconcentrators by putting together a small number of disperser graphs; these disperser graphs are obtained using a probabilistic argument. For obtaining lower bounds, we present two different methods. First, we show that superconcentrators contain several disjoint disperser graphs. When combined with the lower bound for disperser graphs of Kovari, Sos, and Turan, this gives an almost optimal lower bound of
symposium on the theory of computing | 1999
Andris Ambainis; Ashwin Nayak; Amnon Ta-Shma; Umesh V. Vazirani
\Omega( N (\log N/\log \log N)^2)
SIAM Journal on Computing | 2003
Sean Hallgren; Alexander Russell; Amnon Ta-Shma
on the size of
foundations of computer science | 1997
Jaikumar Radhakrishnan; Amnon Ta-Shma
N
