| [1] | A. Bhowmick, Z. Dvir, and S. Lovett. New bounds for matching vector codes. Manuscript, 2012. [ bib | .pdf ] |
| [2] | Z. Dvir, J. Kollár, and S. Lovett. Variety evasive sets. Manuscript, 2012. [ bib | .pdf ] |
| [3] | Z. Dvir and S. Lovett. Subspace evasive sets. STOC 2012 (to appear), 2012. [ bib | .pdf ] |
| [4] | Z. Dvir, A. Rao, A. Wigderson, and A. Yehudayoff. Restriction access. ITCS 2012 (to appear), 2012. [ bib | .pdf ] |
| [5] | Z. Dvir, G. Malod, S. Perifel, and A. Yehudayoff. Separating multilinear branching programs and formulas. STOC 2012 (to appear), 2012. [ bib | .pdf ] |
| [6] | A. Bhattacharyya, Z. Dvir, A. Shpilka, and S. Saraf. Tight lower bounds for 2-query lccs over finite fields. In Proc. of FOCS 2011, pages 638-647, 2011. [ bib | .pdf ] |
| [7] | B. Barak, Z. Dvir, A. Yehudayoff, and A. Wigderson. Rank bounds for design matrices with applications to combinatorial geometry and locally correctable codes. In Proceedings of the 43rd annual ACM symposium on Theory of computing, STOC '11, pages 519-528, New York, NY, USA, 2011. ACM. [ bib | .pdf ] |
| [8] | Z. Dvir, D. Gutfreund, G. Rothblum, and S. Vadhan. On approximating the entropy of polynomial mappings. In Proceedings of the Second Symposium on Innovations in Computer Science (ICS 2011), Beijing, China, 7-9 January 2011, 2011. [ bib | .pdf ] |
| [9] | Z. Dvir, P. Gopalan, and S. Yekhanin. Matching vector codes. SIAM J. Comput., 40:1154-1178, 2011. (Extended abstract appeared in FOCS 2010). [ bib | .pdf ] |
| [10] | Z. Dvir and A. Wigderson. Monotone expanders: Constructions and applications. Theory of Computing, 6(1):291-308, 2010. [ bib | DOI | .pdf ] |
| [11] | Z. Dvir. On matrix rigidity and locally self-correctable codes. Computational Complexity, 20(2):367-388, 2011. (Extended abstract appeared in CCC 2010). [ bib | .pdf ] |
| [12] | Z. Dvir. From randomness extraction to rotating needles. SIGACT News, 40(4):46-61, 2009. [ bib | DOI | .pdf ] |
| [13] | Z. Dvir, S. Kopparty, S. Saraf, and M. Sudan. Extensions to the method of multiplicities, with applications to kakeya sets and mergers. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pages 181-190, Washington, DC, USA, 2009. IEEE Computer Society. [ bib | DOI | .pdf ] |
| [14] | Z. Dvir and A. Wigderson. Kakeya sets, new mergers, and old extractors. SIAM J. on Computing, 40(3):778-792, 2011. (Extended abstract appeared in FOCS 2008). [ bib | .pdf ] |
| [15] | Z. Dvir. On the size of Kakeya sets in finite fields. J. Amer. Math. Soc., 22:1093-1097, 2009. [ bib | .pdf ] |
| [16] | Z. Dvir. Extractors for varieties. In Proceedings of the 24th Annual IEEE Conference on Computational Complexity (CCC), pages 102-113, Washington, DC, USA, 2009. IEEE Computer Society. [ bib | DOI | .pdf ] |
| [17] | A. Bogdanov, Z. Dvir, E. Verbin, and A. Yehudayoff. Pseudorandomness for width 2 branching programs. 2009. ECCC Technical report TR09-070. [ bib | .pdf ] |
| [18] | Z. Dvir and A. Shpilka. Noisy interpolating sets for low-degree polynomials. Theory of Computing, 7(1):1-18, 2011. (Extended abstract appeared in CCC 2008). [ bib | DOI | .pdf ] |
| [19] | Z. Dvir, A. Shpilka, and A. Yehudayoff. Hardness-randomness tradeoffs for bounded depth arithmetic circuits. SIAM J. Comput., 39(4):1279-1293, 2009. (Extended abstract appeared in STOC '08). [ bib | .pdf ] |
| [20] | Z. Dvir and A. Shpilka. Towards dimension expanders over finite fields. Combinatorica, 31:305-320, 2011. (Extended abstract appeared at CCC '08). [ bib | .pdf ] |
| [21] | Z. Dvir, A. Gabizon, and A. Wigderson. Extractors and rank extractors for polynomial sources. Comput. Complex., 18(1):1-58, 2009. (Extended abstract appeared in FOCS '07). [ bib | DOI | .pdf ] |
| [22] | Z. Dvir and A. Shpilka. An improved analysis of linear mergers. Comput. Complex., 16(1):34-59, 2007. (Extended abstract appeared in RANDOM '05). [ bib | .pdf ] |
| [23] | Z. Dvir and R. Raz. Analyzing linear mergers. Random Structures and Algorithms, 32(3):334 - 345, 2007. [ bib | .pdf ] |
| [24] | Z. Dvir and A. Shpilka. Locally decodable codes with 2 queries and polynomial identity testing for depth 3 circuits. SIAM J. on Computing, 36(5):1404-1434, 2006. (Extended abstract appeared in STOC '05). [ bib | .pdf ] |
This file was generated by bibtex2html 1.96.