Analyzing Linear Mergers - Zeev Dvir; Ran Raz (Electron. Colloquium Comput. Complex., 2005)

Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits - Zeev Dvir; Amir Shpilka (Electron. Colloquium Comput. Complex., 2005)

An Improved Analysis of Mergers - Zeev Dvir; Amir Shpilka (Electron. Colloquium Comput. Complex., 2005)

An Improved Analysis of Linear Mergers. - Zeev Dvir; Amir Shpilka (Comput. Complex., 2007)

Towards Dimension Expanders Over Finite Fields. - Zeev Dvir; Amir Shpilka (Electron. Colloquium Comput. Complex., 2007)

Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits. - Zeev Dvir; Amir Shpilka (SIAM J. Comput., 2007)

Deterministic Extractors for Algebraic Sources. - Zeev Dvir (Electron. Colloquium Comput. Complex., 2008)

Noisy Interpolating Sets for Low Degree Polynomials. - Zeev Dvir; Amir Shpilka (Electron. Colloquium Comput. Complex., 2008)

Extractors And Rank Extractors For Polynomial Sources. - Zeev Dvir; Ariel Gabizon; Avi Wigderson (Comput. Complex., 2009)

Pseudorandomness for Width 2 Branching Programs. - Andrej Bogdanov; Zeev Dvir; Elad Verbin; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2009)

From Randomness Extraction to Rotating Needles. - Zeev Dvir (Electron. Colloquium Comput. Complex., 2009)

Monotone expanders - constructions and applications. - Zeev Dvir; Avi Wigderson (Electron. Colloquium Comput. Complex., 2009)

Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits. - Zeev Dvir; Amir Shpilka; Amir Yehudayoff (SIAM J. Comput., 2009)

Guest column: from randomness extraction to rotating needles. - Zeev Dvir (SIGACT News, 2009)

Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes. - Boaz Barak; Zeev Dvir; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2010)

On Approximating the Entropy of Polynomial Mappings. - Zeev Dvir; Dan Gutfreund; Guy N. Rothblum; Salil P. Vadhan (Electron. Colloquium Comput. Complex., 2010)

Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. - Boaz Barak; Zeev Dvir; Amir Yehudayoff; Avi Wigderson (STOC, 2011)

On Matrix Rigidity and Locally Self-correctable Codes. - Zeev Dvir (Comput. Complex., 2011)

Tight lower bounds for 2-query LCCs over finite fields. - Arnab Bhattacharyya 001; Zeev Dvir; Shubhangi Saraf; Amir Shpilka (Electron. Colloquium Comput. Complex., 2011)

Subspace Evasive Sets. - Zeev Dvir; Shachar Lovett (Electron. Colloquium Comput. Complex., 2011)

Separating multilinear branching programs and formulas. - Zeev Dvir; Guillaume Malod; Sylvain Perifel; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2011)

Restriction Access. - Zeev Dvir; Anup Rao 001; Avi Wigderson; Amir Yehudayoff (Electron. Colloquium Comput. Complex., 2011)

Matching Vector Codes. - Zeev Dvir; Parikshit Gopalan; Sergey Yekhanin (SIAM J. Comput., 2011)

Kakeya Sets, New Mergers, and Old Extractors. - Zeev Dvir; Avi Wigderson (SIAM J. Comput., 2011)

Extractors for varieties. - Zeev Dvir (Comput. Complex., 2012)

Sylvester-Gallai type theorems for approximate collinearity. - Albert Ai; Zeev Dvir; Shubhangi Saraf; Avi Wigderson (Electron. Colloquium Comput. Complex., 2012)

New Lower Bounds for Matching Vector Codes. - Abhishek Bhowmick 001; Zeev Dvir; Shachar Lovett (Electron. Colloquium Comput. Complex., 2012)

Improved rank bounds for design matrices and a new proof of Kelly's theorem. - Zeev Dvir; Shubhangi Saraf; Avi Wigderson (Electron. Colloquium Comput. Complex., 2012)

Incidence Theorems and Their Applications. - Zeev Dvir (Found. Trends Theor. Comput. Sci., 2012)

Matching-Vector Families and LDCs Over Large Modulo. - Zeev Dvir; Guangda Hu (Electron. Colloquium Comput. Complex., 2013)

Breaking the quadratic barrier for 3-LCCs over the Reals. - Zeev Dvir; Shubhangi Saraf; Avi Wigderson (Electron. Colloquium Comput. Complex., 2013)

Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. - Zeev Dvir; Swastik Kopparty; Shubhangi Saraf; Madhu Sudan 001 (SIAM J. Comput., 2013)

Breaking the quadratic barrier for 3-LCC's over the reals. - Zeev Dvir; Shubhangi Saraf; Avi Wigderson (STOC, 2014)

Variety Evasive Sets. - Zeev Dvir; János Kollár; Shachar Lovett (Comput. Complex., 2014)

Lower Bounds for Approximate LDC. - Jop Briët; Zeev Dvir; Guangda Hu; Shubhangi Saraf (CoRR, 2014)

Lower Bounds for Approximate LDCs. - Jop Briët; Zeev Dvir; Guangda Hu; Shubhangi Saraf (Electron. Colloquium Comput. Complex., 2014)

2-Server PIR with sub-polynomial communication. - Zeev Dvir; Sivakanth Gopi (Electron. Colloquium Comput. Complex., 2014)

Factors of Sparse Polynomials are Sparse. - Zeev Dvir; Rafael Oliveira 002 (Electron. Colloquium Comput. Complex., 2014)

Testing Equivalence of Polynomials under Shifts. - Zeev Dvir; Rafael Oliveira 002; Amir Shpilka (Electron. Colloquium Comput. Complex., 2014)

New Bounds for Matching Vector Families. - Abhishek Bhowmick 001; Zeev Dvir; Shachar Lovett (SIAM J. Comput., 2014)

On the Number of Rich Lines in Truly High Dimensional Sets. - Zeev Dvir; Sivakanth Gopi (SoCG, 2015)

A Quantitative Variant of the Multi-colored Motzkin-Rabin Theorem. - Zeev Dvir; Christian Tessier-Lavigne (Discret. Comput. Geom., 2015)

Affine extractors over large fields with exponential error. - Jean Bourgain; Zeev Dvir; Ethan Leeman (Comput. Complex., 2016)

Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword. - Zeev Dvir; David Zuckerman (Comput. Complex., 2016)

Tight lower bounds for linear 2-query LCCs over finite fields. - Arnab Bhattacharyya 001; Zeev Dvir; Shubhangi Saraf; Amir Shpilka (Comb., 2016)

Rank bounds for design matrices with block entries and geometric applications. - Zeev Dvir; Ankit Garg; Rafael Oliveira 002; József Solymosi (CoRR, 2016)

Sylvester-Gallai for Arrangements of Subspaces. - Zeev Dvir; Guangda Hu (Discret. Comput. Geom., 2016)

2-Server PIR with Subpolynomial Communication. - Zeev Dvir; Sivakanth Gopi (J. ACM, 2016)

Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals. - Zeev Dvir; Shubhangi Saraf; Avi Wigderson (Theory Comput., 2017)

A Sauer-Shelah-Perles Lemma for Sumsets. - Zeev Dvir; Shay Moran (Electron. J. Comb., 2018)

Spanoids - an abstraction of spanning structures, and a barrier for LCCs. - Zeev Dvir; Sivakanth Gopi; Avi Wigderson (CoRR, 2018)

Static Data Structure Lower Bounds Imply Rigidity. - Zeev Dvir; Alexander Golovnev; Omri Weinstein (Electron. Colloquium Comput. Complex., 2018)

On the Number of Ordinary Lines Determined by Sets in Complex Space. - Abdul Basit 001; Zeev Dvir; Shubhangi Saraf; Charles Wolf (Discret. Comput. Geom., 2019)

Fourier and Circulant Matrices are Not Rigid. - Zeev Dvir; Allen Liu (Electron. Colloquium Comput. Complex., 2019)

Outlaw Distributions and Locally Decodable Codes. - Jop Briët; Zeev Dvir; Sivakanth Gopi (Theory Comput., 2019)

Matrix Rigidity and the Croot-Lev-Pach Lemma. - Zeev Dvir; Benjamin L. Edelman (Theory Comput., 2019)

A Sauer-Shelah-Perles Lemma for Lattices. - Stijn Cambie; Bogdan Chornomaz; Zeev Dvir; Yuval Filmus; Shay Moran (Electron. J. Comb., 2020)

Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs. - Zeev Dvir; Sivakanth Gopi; Yuzhou Gu; Avi Wigderson (SIAM J. Comput., 2020)

Proof of the Kakeya set conjecture over rings of integers modulo square-free N. - Manik Dhar; Zeev Dvir (Comb. Theory, 2021)

Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. - Manik Dhar; Zeev Dvir (FOCS, 2022)

Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. - Manik Dhar; Zeev Dvir (Electron. Colloquium Comput. Complex., 2022)

Guest Editors' Foreword to the CCC 2020 Special Issue. - Zeev Dvir; Avishay Tal (Adv. Math. Commun., 2022)

Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg-Erman Proof. - Manik Dhar; Zeev Dvir; Ben Lund 002 (Discret. Comput. Geom., 2024)