Zeev Dvir

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 33

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

Theory Comput.

Discret. Comput. Geom.

Publications

Manik Dhar, Zeev Dvir, Ben Lund
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg-Erman Proof. Discret. Comput. Geom. 71 (2) (2024)
Manik Dhar, Zeev Dvir
guarantees and two-sided Kakeya bounds. CoRR (2022)
Manik Dhar, Zeev Dvir
Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. FOCS (2022)
Manik Dhar, Zeev Dvir
guarantees and two-sided Kakeya bounds. Electron. Colloquium Comput. Complex. (2022)
Zeev Dvir, Avishay Tal
Guest Editors' Foreword to the CCC 2020 Special Issue. Theory Comput. 18 (2022)
Zeev Dvir, Allen Liu
Fourier and Circulant Matrices are Not Rigid. Theory Comput. 16 (2020)
Stijn Cambie, Bogdan Chornomaz, Zeev Dvir, Yuval Filmus, Shay Moran
A Sauer-Shelah-Perles Lemma for Lattices. Electron. J. Comb. 27 (4) (2020)
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. SIAM J. Comput. 49 (3) (2020)
Zeev Dvir, Allen Liu
Fourier and Circulant Matrices are Not Rigid. CoRR (2019)
Zeev Dvir, Benjamin L. Edelman
Matrix Rigidity and the Croot-Lev-Pach Lemma. Theory Comput. 15 (2019)
Jop Briët, Zeev Dvir, Sivakanth Gopi
Outlaw Distributions and Locally Decodable Codes. Theory Comput. 15 (2019)
Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf
On the Number of Ordinary Lines Determined by Sets in Complex Space. Discret. Comput. Geom. 61 (4) (2019)
Zeev Dvir, Allen Liu
Fourier and Circulant Matrices Are Not Rigid. Computational Complexity Conference (2019)
Zeev Dvir, Allen Liu
Fourier and Circulant Matrices are Not Rigid. Electron. Colloquium Comput. Complex. 26 (2019)
Zeev Dvir, Alexander Golovnev, Omri Weinstein
Static data structure lower bounds imply rigidity. STOC (2019)
Zeev Dvir, Sivakanth Gopi, Yuzhou Gu, Avi Wigderson
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. ITCS (2019)
Zeev Dvir, Alexander Golovnev, Omri Weinstein
Static Data Structure Lower Bounds Imply Rigidity. Electron. Colloquium Comput. Complex. 25 (2018)
Zeev Dvir, Shay Moran
A Sauer-Shelah-Perles Lemma for Sumsets. Electron. J. Comb. 25 (4) (2018)
Zeev Dvir, Alexander Golovnev, Omri Weinstein
Static Data Structure Lower Bounds Imply Rigidity. CoRR (2018)
Zeev Dvir, Sivakanth Gopi, Avi Wigderson
Spanoids - an abstraction of spanning structures, and a barrier for LCCs. CoRR (2018)
Zeev Dvir, Shay Moran
A Sauer-Shelah-Perles Lemma for Sumsets. CoRR (2018)
Zeev Dvir, Benjamin L. Edelman
Matrix rigidity and the Croot-Lev-Pach lemma. CoRR (2017)
Jop Briët, Zeev Dvir, Sivakanth Gopi
Outlaw Distributions and Locally Decodable Codes. ITCS (2017)
Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. Theory Comput. 13 (1) (2017)
Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf
On the Number of Ordinary Lines Determined by Sets in Complex Space. SoCG (2017)
Zeev Dvir, Ankit Garg, Rafael Mendes de Oliveira, József Solymosi
Rank bounds for design matrices with block entries and geometric applications. CoRR (2016)
Jop Briët, Zeev Dvir, Sivakanth Gopi
Outlaw distributions and locally decodable codes. CoRR (2016)
Zeev Dvir, David Zuckerman
Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. Comput. Complex. 25 (2) (2016)
Zeev Dvir, Guangda Hu
Sylvester-Gallai for Arrangements of Subspaces. Discret. Comput. Geom. 56 (4) (2016)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with Subpolynomial Communication. J. ACM 63 (4) (2016)
Abdul Basit, Zeev Dvir, Shubhangi Saraf, Charles Wolf
On the number of ordinary lines determined by sets in complex space. CoRR (2016)
Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka
Tight lower bounds for linear 2-query LCCs over finite fields. Comb. 36 (1) (2016)
Jean Bourgain, Zeev Dvir, Ethan Leeman
Affine extractors over large fields with exponential error. Comput. Complex. 25 (4) (2016)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with Sub-Polynomial Communication. STOC (2015)
Zeev Dvir, Christian Tessier-Lavigne
A Quantitative Variant of the Multi-colored Motzkin-Rabin Theorem. Discret. Comput. Geom. 53 (1) (2015)
Zeev Dvir, Guangda Hu
Sylvester-Gallai for Arrangements of Subspaces. SoCG (2015)
Zeev Dvir, Sivakanth Gopi
On the Number of Rich Lines in Truly High Dimensional Sets. SoCG (2015)
Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
Lower Bounds for Approximate LDCs. ICALP (1) (2014)
Jean Bourgain, Zeev Dvir, Ethan Leeman
Affine extractors over large fields with exponential error. CoRR (2014)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with sub-polynomial communication. CoRR (2014)
Zeev Dvir, Rafael Mendes de Oliveira
Factors of Sparse Polynomials are Sparse. Electron. Colloquium Comput. Complex. 21 (2014)
Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka
Testing Equivalence of Polynomials under Shifts. ICALP (1) (2014)
Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka
Testing Equivalence of Polynomials under Shifts. CoRR (2014)
Zeev Dvir, Sivakanth Gopi
On the number of rich lines in truly high dimensional sets. CoRR (2014)
Zeev Dvir, Sivakanth Gopi
2-Server PIR with sub-polynomial communication. Electron. Colloquium Comput. Complex. 21 (2014)
Zeev Dvir, Rafael Mendes de Oliveira, Amir Shpilka
Testing Equivalence of Polynomials under Shifts. Electron. Colloquium Comput. Complex. 21 (2014)
Zeev Dvir, János Kollár, Shachar Lovett
Variety Evasive Sets. Comput. Complex. 23 (4) (2014)
Zeev Dvir, Guangda Hu
Sylvester-Gallai for Arrangements of Subspaces. CoRR (2014)
Jean Bourgain, Zeev Dvir, Ethan Leeman
Affine extractors over large fields with exponential error. Electron. Colloquium Comput. Complex. 21 (2014)
Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
Lower Bounds for Approximate LDC. CoRR (2014)
Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Breaking the quadratic barrier for 3-LCC's over the reals. STOC (2014)
Jop Briët, Zeev Dvir, Guangda Hu, Shubhangi Saraf
Lower Bounds for Approximate LDCs. Electron. Colloquium Comput. Complex. 21 (2014)
Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
New Bounds for Matching Vector Families. SIAM J. Comput. 43 (5) (2014)
Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
New bounds for matching vector families. STOC (2013)
Zeev Dvir, Guangda Hu
Matching-Vector Families and LDCs Over Large Modulo. Electron. Colloquium Comput. Complex. 20 (2013)
Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff
Pseudorandomness for Width-2 Branching Programs. Theory Comput. 9 (2013)
Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Breaking the quadratic barrier for 3-LCCs over the Reals. Electron. Colloquium Comput. Complex. 20 (2013)
Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Breaking the quadratic barrier for 3-LCCs over the Reals. CoRR (2013)
Zeev Dvir, Guangda Hu
Matching-Vector Families and LDCs Over Large Modulo CoRR (2013)
Zeev Dvir, Guangda Hu
Matching-Vector Families and LDCs over Large Modulo. APPROX-RANDOM (2013)
Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. SIAM J. Comput. 42 (6) (2013)
Zeev Dvir
Extractors for varieties. Comput. Complex. 21 (4) (2012)
Zeev Dvir, Shachar Lovett
Subspace evasive sets. STOC (2012)
Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Improved rank bounds for design matrices and a new proof of Kelly's theorem. Electron. Colloquium Comput. Complex. 19 (2012)
Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
New Lower Bounds for Matching Vector Codes CoRR (2012)
Zeev Dvir
Incidence Theorems and Their Applications. Found. Trends Theor. Comput. Sci. 6 (4) (2012)
Zeev Dvir, János Kollár, Shachar Lovett
Variety Evasive Sets CoRR (2012)
Zeev Dvir
Incidence Theorems and Their Applications CoRR (2012)
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff
Separating multilinear branching programs and formulas. STOC (2012)
Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Improved rank bounds for design matrices and a new proof of Kelly's theorem CoRR (2012)
Abhishek Bhowmick, Zeev Dvir, Shachar Lovett
New Lower Bounds for Matching Vector Codes. Electron. Colloquium Comput. Complex. 19 (2012)
Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Sylvester-Gallai type theorems for approximate collinearity. Electron. Colloquium Comput. Complex. 19 (2012)
Albert Ai, Zeev Dvir, Shubhangi Saraf, Avi Wigderson
Sylvester-Gallai type theorems for approximate collinearity CoRR (2012)
Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff
Restriction access. ITCS (2012)
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
Matching Vector Codes. SIAM J. Comput. 40 (4) (2011)
Arnab Bhattacharyya, Zeev Dvir, Shubhangi Saraf, Amir Shpilka
Tight lower bounds for 2-query LCCs over finite fields. Electron. Colloquium Comput. Complex. 18 (2011)
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan
On Approximating the Entropy of Polynomial Mappings. ICS (2011)
Zeev Dvir, Anup Rao, Avi Wigderson, Amir Yehudayoff
Restriction Access. Electron. Colloquium Comput. Complex. 18 (2011)
Zeev Dvir, Shachar Lovett
Subspace Evasive Sets CoRR (2011)
Zeev Dvir, Amir Shpilka
Noisy Interpolating Sets for Low-Degree Polynomials. Theory Comput. 7 (1) (2011)
Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson
Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. STOC (2011)
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff
Separating multilinear branching programs and formulas. Electron. Colloquium Comput. Complex. 18 (2011)
Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf
Tight Lower Bounds for 2-query LCCs over Finite Fields. FOCS (2011)
Zeev Dvir, Shachar Lovett
Subspace Evasive Sets. Electron. Colloquium Comput. Complex. 18 (2011)
Zeev Dvir, Amir Shpilka
Towards dimension expanders over finite fields. Comb. 31 (3) (2011)
Zeev Dvir, Avi Wigderson
Kakeya Sets, New Mergers, and Old Extractors. SIAM J. Comput. 40 (3) (2011)
Zeev Dvir
On Matrix Rigidity and Locally Self-correctable Codes. Comput. Complex. 20 (2) (2011)
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
Matching Vector Codes. Electron. Colloquium Comput. Complex. 17 (2010)
Zeev Dvir, Dan Gutfreund, Guy N. Rothblum, Salil P. Vadhan
On Approximating the Entropy of Polynomial Mappings. Electron. Colloquium Comput. Complex. 17 (2010)
Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. Electron. Colloquium Comput. Complex. 17 (2010)
Zeev Dvir, Avi Wigderson
Monotone Expanders: Constructions and Applications. Theory Comput. 6 (1) (2010)
Boaz Barak, Zeev Dvir, Avi Wigderson, Amir Yehudayoff
Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes CoRR (2010)
Zeev Dvir
On Matrix Rigidity and Locally Self-Correctable Codes. Computational Complexity Conference (2010)
Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin
Matching Vector Codes. FOCS (2010)
Zeev Dvir, Amir Shpilka, Amir Yehudayoff
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. SIAM J. Comput. 39 (4) (2009)
Zeev Dvir
From Randomness Extraction to Rotating Needles. Electron. Colloquium Comput. Complex. 16 (2009)
Zeev Dvir
Guest column: from randomness extraction to rotating needles. SIGACT News 40 (4) (2009)
Zeev Dvir, Avi Wigderson
Monotone expanders - constructions and applications. Electron. Colloquium Comput. Complex. 16 (2009)
Andrej Bogdanov, Zeev Dvir, Elad Verbin, Amir Yehudayoff
Pseudorandomness for Width 2 Branching Programs. Electron. Colloquium Comput. Complex. 16 (2009)
Zeev Dvir
Extractors for Varieties. Computational Complexity Conference (2009)

Zeev Dvir.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Zeev Dvir