| 2022 | FOCS | Linear Hashing with ℓ∞ guarantees and two-sided Kakeya bounds. | Manik Dhar, Zeev Dvir |
| 2019 | STOC | Static data structure lower bounds imply rigidity. | Zeev Dvir, Alexander Golovnev, Omri Weinstein |
| 2015 | STOC | 2-Server PIR with Sub-Polynomial Communication. | Zeev Dvir, Sivakanth Gopi |
| 2014 | ICALP | Lower Bounds for Approximate LDCs. | Jop Brit, Zeev Dvir, Guangda Hu, Shubhangi Saraf |
| 2014 | ICALP | Testing Equivalence of Polynomials under Shifts. | Zeev Dvir, Rafael Oliveira, Amir Shpilka |
| 2014 | STOC | Breaking the quadratic barrier for 3-LCC's over the reals. | Zeev Dvir, Shubhangi Saraf, Avi Wigderson |
| 2013 | STOC | New bounds for matching vector families. | Abhishek Bhowmick, Zeev Dvir, Shachar Lovett |
| 2012 | STOC | Subspace evasive sets. | Zeev Dvir, Shachar Lovett |
| 2012 | STOC | Separating multilinear branching programs and formulas. | Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir Yehudayoff |
| 2011 | FOCS | Tight Lower Bounds for 2-query LCCs over Finite Fields. | Arnab Bhattacharyya, Zeev Dvir, Amir Shpilka, Shubhangi Saraf |
| 2011 | STOC | Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes. | Boaz Barak, Zeev Dvir, Amir Yehudayoff, Avi Wigderson |
| 2010 | FOCS | Matching Vector Codes. | Zeev Dvir, Parikshit Gopalan, Sergey Yekhanin |
| 2009 | FOCS | Extensions to the Method of Multiplicities, with Applications to Kakeya Sets and Mergers. | Zeev Dvir, Swastik Kopparty, Shubhangi Saraf, Madhu Sudan |
| 2008 | FOCS | Kakeya Sets, New Mergers and Old Extractors. | Zeev Dvir, Avi Wigderson |
| 2008 | STOC | Hardness-randomness tradeoffs for bounded depth arithmetic circuits. | Zeev Dvir, Amir Shpilka, Amir Yehudayoff |
| 2007 | FOCS | Extractors and Rank Extractors for Polynomial Sources. | Zeev Dvir, Ariel Gabizon, Avi Wigderson |
| 2005 | STOC | Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. | Zeev Dvir, Amir Shpilka |