Zeev Dvir

According to our database1, Zeev Dvir authored at least 62 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg-Erman Proof.
Discret. Comput. Geom., March, 2024

2022
Guest Editors' Foreword to the CCC 2020 Special Issue.
Theory Comput., 2022

Linear Hashing with ℓ<sub>∞</sub> guarantees and two-sided Kakeya bounds.
Electron. Colloquium Comput. Complex., 2022

Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2020
Spanoids - An Abstraction of Spanning Structures, and a Barrier for LCCs.
SIAM J. Comput., 2020

A Sauer-Shelah-Perles Lemma for Lattices.
Electron. J. Comb., 2020

2019
Matrix Rigidity and the Croot-Lev-Pach Lemma.
Theory Comput., 2019

Outlaw Distributions and Locally Decodable Codes.
Theory Comput., 2019

Fourier and Circulant Matrices are Not Rigid.
Electron. Colloquium Comput. Complex., 2019

On the Number of Ordinary Lines Determined by Sets in Complex Space.
Discret. Comput. Geom., 2019

2018
Static Data Structure Lower Bounds Imply Rigidity.
Electron. Colloquium Comput. Complex., 2018

Spanoids - an abstraction of spanning structures, and a barrier for LCCs.
CoRR, 2018

A Sauer-Shelah-Perles Lemma for Sumsets.
Electron. J. Comb., 2018

2017
Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals.
Theory Comput., 2017

2016
2-Server PIR with Subpolynomial Communication.
J. ACM, 2016

Sylvester-Gallai for Arrangements of Subspaces.
Discret. Comput. Geom., 2016

Rank bounds for design matrices with block entries and geometric applications.
CoRR, 2016

Tight lower bounds for linear 2-query LCCs over finite fields.
Comb., 2016

Special issue "Computational Complexity Conference 2015" Guest Editors' Foreword.
Comput. Complex., 2016

Affine extractors over large fields with exponential error.
Comput. Complex., 2016

2015
A Quantitative Variant of the Multi-colored Motzkin-Rabin Theorem.
Discret. Comput. Geom., 2015

On the Number of Rich Lines in Truly High Dimensional Sets.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
New Bounds for Matching Vector Families.
SIAM J. Comput., 2014

Testing Equivalence of Polynomials under Shifts.
Electron. Colloquium Comput. Complex., 2014

Factors of Sparse Polynomials are Sparse.
Electron. Colloquium Comput. Complex., 2014

2-Server PIR with sub-polynomial communication.
Electron. Colloquium Comput. Complex., 2014

Lower Bounds for Approximate LDCs.
Electron. Colloquium Comput. Complex., 2014

Lower Bounds for Approximate LDC.
CoRR, 2014

Variety Evasive Sets.
Comput. Complex., 2014

Breaking the quadratic barrier for 3-LCC's over the reals.
Proceedings of the Symposium on Theory of Computing, 2014

2013
Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers.
SIAM J. Comput., 2013

Breaking the quadratic barrier for 3-LCCs over the Reals.
Electron. Colloquium Comput. Complex., 2013

Matching-Vector Families and LDCs Over Large Modulo.
Electron. Colloquium Comput. Complex., 2013

2012
Incidence Theorems and Their Applications.
Found. Trends Theor. Comput. Sci., 2012

Improved rank bounds for design matrices and a new proof of Kelly's theorem.
Electron. Colloquium Comput. Complex., 2012

New Lower Bounds for Matching Vector Codes.
Electron. Colloquium Comput. Complex., 2012

Sylvester-Gallai type theorems for approximate collinearity.
Electron. Colloquium Comput. Complex., 2012

Extractors for varieties.
Comput. Complex., 2012

2011
Kakeya Sets, New Mergers, and Old Extractors.
SIAM J. Comput., 2011

Matching Vector Codes.
SIAM J. Comput., 2011

Restriction Access.
Electron. Colloquium Comput. Complex., 2011

Separating multilinear branching programs and formulas.
Electron. Colloquium Comput. Complex., 2011

Subspace Evasive Sets.
Electron. Colloquium Comput. Complex., 2011

Tight lower bounds for 2-query LCCs over finite fields.
Electron. Colloquium Comput. Complex., 2011

On Matrix Rigidity and Locally Self-correctable Codes.
Comput. Complex., 2011

Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes.
Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

2010
On Approximating the Entropy of Polynomial Mappings.
Electron. Colloquium Comput. Complex., 2010

Rank Bounds for Design Matrices with Applications to Combinatorial Geometry and Locally Correctable Codes.
Electron. Colloquium Comput. Complex., 2010

2009
Guest column: from randomness extraction to rotating needles.
SIGACT News, 2009

Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits.
SIAM J. Comput., 2009

Monotone expanders - constructions and applications.
Electron. Colloquium Comput. Complex., 2009

From Randomness Extraction to Rotating Needles.
Electron. Colloquium Comput. Complex., 2009

Pseudorandomness for Width 2 Branching Programs.
Electron. Colloquium Comput. Complex., 2009

Extractors And Rank Extractors For Polynomial Sources.
Comput. Complex., 2009

2008
Noisy Interpolating Sets for Low Degree Polynomials.
Electron. Colloquium Comput. Complex., 2008

Deterministic Extractors for Algebraic Sources.
Electron. Colloquium Comput. Complex., 2008

2007
Locally Decodable Codes with Two Queries and Polynomial Identity Testing for Depth 3 Circuits.
SIAM J. Comput., 2007

Towards Dimension Expanders Over Finite Fields.
Electron. Colloquium Comput. Complex., 2007

An Improved Analysis of Linear Mergers.
Comput. Complex., 2007

2005
An Improved Analysis of Mergers
Electron. Colloquium Comput. Complex., 2005

Locally Decodable Codes with 2 queries and Polynomial Identity Testing for depth 3 circuits
Electron. Colloquium Comput. Complex., 2005

Analyzing Linear Mergers
Electron. Colloquium Comput. Complex., 2005


  Loading...