Dvir, Zeev

1. 2-Server PIR with sub-polynomial communication
   2014/07/24 by Dvir, Zeev, Gopi, Sivakanth · 4 citations
   #Computational Complexity (cs.CC) #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Retrieval (cs.IR)
2. Incidence Theorems and Their Applications
   2012/08/24 by Dvir, Zeev · 3 citations
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics
3. Extensions to the Method of Multiplicities, with applications to Kakeya Sets and Mergers
   2009/01/16 by Dvir, Zeev, Kopparty, Swastik, Saraf, Shubhangi +1 · 2 citations
   #11T71 #52C17 #68R05 #Combinatorics (math.CO) #FOS: Mathematics
4. Rank Bounds for Design Matrices with Applications to Combinatorial\n Geometry and Locally Correctable Codes
   2010/09/22 by Boaz Barak, Zeev Dvir, Barak, Boaz +5 · 2 citations
   Computer Science · Engineering · #Coding theory and cryptography #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Metric Geometry (math.MG) #graph theory and CDMA systems
5. New Lower Bounds for Matching Vector Codes
   2012/04/05 by Bhowmick, Abhishek, Dvir, Zeev, Lovett, Shachar · 2 citations
   #68Q17 #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics
6. Variety Evasive Sets
   2012/03/20 by Zeev Dvir, Dvir, Zeev, Janós Kollár +3 · 2 citations
   Computer Science · Engineering · Mathematics · #Algebraic Geometry (math.AG) #Coding theory and cryptography #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems
7. Improved rank bounds for design matrices and a new proof of Kelly's theorem
   2012/11/01 by Zeev Dvir, Shubhangi Saraf, Dvir, Zeev +3 · 2 citations
   Computer Science · Decision Sciences · Engineering · Mathematics · #05B20 #52C35 #Advanced Optimization Algorithms Research #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Computational Geometry (cs.CG) #Digital Image Processing Techniques #F.2.1 #F.2.2 #FOS: Computer and information sciences #FOS: Mathematics #Multi-Criteria Decision Making #Sparse and Compressive Sensing Techniques #graph theory and CDMA systems
8. Testing Equivalence of Polynomials under Shifts
   2014/01/15 by Zeev Dvir, Rafael Oliveira, Dvir, Zeev +2 · 1 citation
   Computer Science · #Complexity and Algorithms in Graphs #Algorithms and Data Compression #semigroups and automata theory
9. Static Data Structure Lower Bounds Imply Rigidity
   2018/11/07 by Dvir, Zeev, Golovnev, Alexander, Weinstein, Omri · 1 citation
   #Combinatorics (math.CO) #Computational Complexity (cs.CC) #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #FOS: Mathematics
10. Fourier and Circulant Matrices are Not Rigid
    2019/02/19 by Dvir, Zeev, Liu, Allen · 1 citation
    #Combinatorics (math.CO) #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Mathematics