Follow
Zeev Dvir
Zeev Dvir
Verified email at cs.princeton.edu - Homepage
Title
Cited by
Cited by
Year
On the size of Kakeya sets in finite fields
Z Dvir
Journal of the American Mathematical Society 22 (4), 1093-1097, 2009
2862009
Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits
Z Dvir, A Shpilka
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
1882005
Extensions to the method of multiplicities, with applications to Kakeya sets and mergers
Z Dvir, S Kopparty, S Saraf, M Sudan
SIAM Journal on Computing 42 (6), 2305-2328, 2013
1872013
2-server PIR with subpolynomial communication
Z Dvir, S Gopi
Journal of the ACM (JACM) 63 (4), 1-15, 2016
1282016
Matching vector codes
Z Dvir, P Gopalan, S Yekhanin
SIAM Journal on Computing 40 (4), 1154-1178, 2011
972011
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
Z Dvir, A Shpilka, A Yehudayoff
Proceedings of the fortieth annual ACM symposium on Theory of computing, 741-748, 2008
902008
Extractors and rank extractors for polynomial sources
Z Dvir, A Gabizon, A Wigderson
Computational Complexity 18 (1), 1-58, 2009
722009
Kakeya sets, new mergers, and old extractors
Z Dvir, A Wigderson
SIAM Journal on Computing 40 (3), 778-792, 2011
712011
Subspace evasive sets
Z Dvir, S Lovett
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
622012
Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes
B Barak, Z Dvir, A Wigderson, A Yehudayoff
STOC 2011, 2010
592010
Incidence theorems and their applications
Z Dvir
Foundations and Trends® in Theoretical Computer Science 6 (4), 257-393, 2012
552012
Extractors for varieties
Z Dvir
Computational Complexity, 2009. CCC'09. 24th Annual IEEE Conference on, 102-113, 2009
522009
Pseudorandomness for width-2 branching programs
A Bogdanov, Z Dvir, E Verbin, A Yehudayoff
Theory of Computing 9 (1), 283-293, 2013
462013
Improved rank bounds for design matrices and a new proof of Kelly’s theorem
Z Dvir, S Saraf, A Wigderson
Forum of Mathematics, Sigma 2, 2014
402014
On matrix rigidity and locally self-correctable codes
Z Dvir
computational complexity 20 (2), 367-388, 2011
392011
Separating multilinear branching programs and formulas
Z Dvir, G Malod, S Perifel, A Yehudayoff
Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012
382012
Restriction access
Z Dvir, A Rao, A Wigderson, A Yehudayoff
Proceedings of the 3rd Innovations in Theoretical Computer Science …, 2012
302012
On approximating the entropy of polynomial mappings
Z Dvir, D Gutfreund, GN Rothblum, SP Vadhan
292017
New bounds for matching vector families
A Bhowmick, Z Dvir, S Lovett
Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013
29*2013
Static data structure lower bounds imply rigidity
Z Dvir, A Golovnev, O Weinstein
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019
282019
The system can't perform the operation now. Try again later.
Articles 1–20