BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Dvir Z, Liu A. (2019) Fourier and Circulant Matrices are Not Rigid Electronic Colloquium On Computational Complexity. 26: 23 |
| Briët J, Dvir Z, Gopi S. (2019) Outlaw distributions and locally decodable codes Theory of Computing. 15: 1-24 |
| Basit A, Dvir Z, Saraf S, et al. (2019) On the Number of Ordinary Lines Determined by Sets in Complex Space Discrete and Computational Geometry. 61: 778-808 |
| Dvir Z, Saraf S, Wigderson A. (2017) Superquadratic Lower Bound for 3-Query Locally Correctable Codes over the Reals Theory of Computing. 13: 1-36 |
| Bhattacharyya A, Dvir Z, Saraf S, et al. (2015) Tight lower bounds for linear 2-query LCCs over finite fields Combinatorica. 1-36 |
| Dvir Z, Hu G. (2015) Sylvester-Gallai for Arrangements of Subspaces Leibniz International Proceedings in Informatics, Lipics. 34: 29-43 |
| Dvir Z, Tessier-Lavigne C. (2015) A Quantitative Variant of the Multi-colored Motzkin–Rabin Theorem Discrete and Computational Geometry. 53: 38-47 |
| Bourgain J, Dvir Z, Leeman E. (2015) Affine extractors over large fields with exponential error Computational Complexity |
| Bhowmick A, Dvir Z, Lovett S. (2014) New bounds for matching vector families Siam Journal On Computing. 43: 1654-1683 |
| Dvir Z, Saraf S, Wigderson A. (2014) Improved rank bounds for design matrices and a new proof of Kelly's theorem Forum of Mathematics, Sigma. 2 |