Zeev Dvir
Contact Expert

View Scopus Profile

Zeev Dvir

Calculated based on number of publications stored in Pure and citations from Scopus
20052024

Research activity per year

  • 36 Article
  • 28 Conference contribution
  • 2 Conference article
  • 1 Editorial
Filter
Conference contribution

Search results

  • 2022

    Linear Hashing with l8guarantees and two-sided Kakeya bounds

    Dhar, M. & Dvir, Z., 2022, Proceedings - 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science, FOCS 2022. IEEE Computer Society, p. 419-428 10 p. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS; vol. 2022-October).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2019

    Fourier and circulant matrices are not rigid

    Dvir, Z. & Liu, A., Jul 1 2019, 34th Computational Complexity Conference, CCC 2019. Shpilka, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 137).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    3 Scopus citations

  • Spanoids – An abstraction of spanning structures, and a barrier for LCCS

    Dvir, Z., Gopi, S., Gu, Y. & Wigderson, A., Jan 1 2019, 10th Innovations in Theoretical Computer Science, ITCS 2019. Blum, A. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 32. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 124).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    1 Scopus citations

  • Static data structure lower bounds imply rigidity

    Dvir, Z., Golovnev, A. & Weinstein, O., Jun 23 2019, STOC 2019 - Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing. Charikar, M. & Cohen, E. (eds.). Association for Computing Machinery, p. 967-978 12 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    14 Scopus citations
  • 2017

    On the number of ordinary lines determined by sets in complex space

    Basit, A., Dvir, Z., Saraf, S. & Wolf, C., Jun 1 2017, 33rd International Symposium on Computational Geometry, SoCG 2017. Katz, M. J. & Aronov, B. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 151-1515 1365 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 77).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Outlaw distributions and locally decodablecodes

    Briët, J., Dvir, Z. & Gopi, S., Nov 1 2017, 8th Innovations in Theoretical Computer Science Conference, ITCS 2017. Papadimitriou, C. H. (ed.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, (Leibniz International Proceedings in Informatics, LIPIcs; vol. 67).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    6 Scopus citations
  • 2015

    2-server PIR with sub-polynomial communication

    Dvir, Z. & Gopi, S., Jun 14 2015, STOC 2015 - Proceedings of the 2015 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 577-584 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing; vol. 14-17-June-2015).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    42 Scopus citations

  • On the Number of Rich Lines in Truly High Dimensional Sets

    Dvir, Z. & Gopi, S., Jun 1 2015, 31st International Symposium on Computational Geometry, SoCG 2015. Pach, J., Pach, J. & Arge, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 584-598 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    9 Scopus citations

  • Sylvester-Gallai for Arrangements of Subspaces

    Dvir, Z. & Hu, G., Jun 1 2015, 31st International Symposium on Computational Geometry, SoCG 2015. Pach, J., Pach, J. & Arge, L. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 29-43 15 p. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 34).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • 2014

    Breaking the quadratic barrier for 3-LCC's over the Reals

    Dvir, Z., Saraf, S. & Wigderson, A., 2014, STOC 2014 - Proceedings of the 2014 ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 784-793 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    19 Scopus citations

  • Lower bounds for approximate LDCs

    Briët, J., Dvir, Z., Hu, G. & Saraf, S., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer Verlag, p. 259-270 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

  • Testing equivalence of polynomials under shifts

    Dvir, Z., De Oliveira, R. M. & Shpilka, A., 2014, Automata, Languages, and Programming - 41st International Colloquium, ICALP 2014, Proceedings. PART 1 ed. Springer Verlag, p. 417-428 12 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8572 LNCS, no. PART 1).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    16 Scopus citations
  • 2013

    Matching-vector families and LDCs over large modulo

    Dvir, Z. & Hu, G., 2013, Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques - 16th International Workshop, APPROX 2013 and 17th International Workshop, RANDOM 2013, Proceedings. p. 513-526 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 8096 LNCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    5 Scopus citations

  • New bounds for matching vector families

    Bhowmick, A., Dvir, Z. & Lovett, S., 2013, STOC 2013 - Proceedings of the 2013 ACM Symposium on Theory of Computing. p. 823-832 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    11 Scopus citations
  • 2012

    Restriction access

    Dvir, Z., Rao, A., Wigderson, A. & Yehudayoff, A., 2012, ITCS 2012 - Innovations in Theoretical Computer Science Conference. p. 19-33 15 p. (ITCS 2012 - Innovations in Theoretical Computer Science Conference).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    21 Scopus citations

  • Separating multilinear branching programs and formulas

    Dvir, Z., Malod, G., Perifel, S. & Yehudayoff, A., 2012, STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. p. 615-623 9 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    31 Scopus citations

  • Subspace evasive sets

    Dvir, Z. & Lovett, S., 2012, STOC '12 - Proceedings of the 2012 ACM Symposium on Theory of Computing. p. 351-358 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    52 Scopus citations
  • 2011

    Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codes

    Barak, B., Dvir, Z., Yehudayoff, A. & Wigderson, A., 2011, STOC'11 - Proceedings of the 43rd ACM Symposium on Theory of Computing. Association for Computing Machinery, p. 519-528 10 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    44 Scopus citations

  • Tight lower bounds for 2-query LCCs over finite fields

    Bhattacharyya, A., Dvir, Z., Shpilka, A. & Saraf, S., 2011, Proceedings - 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011. p. 638-647 10 p. 6108225. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    14 Scopus citations
  • 2010

    Matching vector codes

    Dvir, Z., Gopalan, P. & Yekhanin, S., 2010, Proceedings - 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, FOCS 2010. IEEE Computer Society, p. 705-714 10 p. 5671335. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    19 Scopus citations

  • On matrix rigidity and locally self-correctable codes

    Dvir, Z., 2010, Proceedings - 25th Annual IEEE Conference on Computational Complexity, CCC 2010. p. 291-298 8 p. 5497878. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    21 Scopus citations
  • 2009

    Extensions to the method of multiplicities, with applications to Kakeya sets and mergers

    Dvir, Z., Kopparty, S., Saraf, S. & Sudan, M., 2009, Proceedings - 50th Annual Symposium on Foundations of Computer Science, FOCS 2009. p. 181-190 10 p. 5438635. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    59 Scopus citations

  • Extractors for Varieties

    Dvir, Z., 2009, Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity, CCC 2009. p. 102-113 12 p. 5231245. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    12 Scopus citations
  • 2008

    Hardness-randomness tradeoffs for bounded depth arithmetic circuits

    Dvir, Z., Shpilka, A. & Yehudayoff, A., 2008, STOC'08: Proceedings of the 2008 ACM Symposium on Theory of Computing. Association for Computing Machinery (ACM), p. 741-748 8 p. (Proceedings of the Annual ACM Symposium on Theory of Computing).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    6 Scopus citations

  • Kakeya sets, new mergers and old extractors

    Dvir, Z. & Wigderson, A., 2008, Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008. p. 625-633 9 p. 4690995. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    Open Access
    25 Scopus citations

  • Noisy Interpolating Sets for low degree polynomials

    Dvir, Z. & Shpilka, A., 2008, Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008. p. 140-148 9 p. 4558818. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    2 Scopus citations

  • Towards dimension expanders over finite fields

    Dvir, Z. & Shpilka, A., 2008, Proceedings - 23rd Annual IEEE Conference on Computational Complexity, CCC 2008. p. 304-310 7 p. 4558832. (Proceedings of the Annual IEEE Conference on Computational Complexity).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    4 Scopus citations
  • 2007

    Extractors and rank extractors for polynomial sources

    Dvir, Z., Gabizon, A. & Wigderson, A., 2007, Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007. p. 52-62 11 p. 4389479. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

    Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

    10 Scopus citations