Zeev Dvir

1.3k total citations
53 papers, 562 citations indexed

About

Zeev Dvir is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Zeev Dvir has authored 53 papers receiving a total of 562 indexed citations (citations by other indexed papers that have themselves been cited), including 31 papers in Computational Theory and Mathematics, 28 papers in Artificial Intelligence and 16 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Zeev Dvir's work include Coding theory and cryptography (22 papers), Complexity and Algorithms in Graphs (18 papers) and Limits and Structures in Graph Theory (15 papers). Zeev Dvir is often cited by papers focused on Coding theory and cryptography (22 papers), Complexity and Algorithms in Graphs (18 papers) and Limits and Structures in Graph Theory (15 papers). Zeev Dvir collaborates with scholars based in United States, Israel and China. Zeev Dvir's co-authors include Amir Shpilka, Avi Wigderson, Shubhangi Saraf, Shachar Lovett, Amir Yehudayoff, Swastik Kopparty, Madhu Sudan, Sivakanth Gopi, Sergey Yekhanin and Parikshit Gopalan and has published in prestigious journals such as Proceedings of the National Academy of Sciences, SHILAP Revista de lepidopterología and European Journal of Applied Physiology.

In The Last Decade

Zeev Dvir

48 papers receiving 482 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Zeev Dvir United States	13	346	332	115	111	104	53	562
Shachar Lovett United States	15	402 1.2×	353 1.1×	125 1.1×	119 1.1×	151 1.5×	103	680
Christine Bachoc France	11	327 0.9×	131 0.4×	275 2.4×	92 0.8×	169 1.6×	34	521
Stasys Jukna Germany	9	245 0.7×	397 1.2×	87 0.8×	111 1.0×	76 0.7×	42	571
Mark Giesbrecht Canada	14	238 0.7×	409 1.2×	83 0.7×	17 0.2×	65 0.6×	50	539
Swastik Kopparty United States	13	387 1.1×	226 0.7×	194 1.7×	316 2.8×	47 0.5×	50	652
B. David Saunders United States	13	134 0.4×	320 1.0×	78 0.7×	26 0.2×	42 0.4×	42	418
Aart Blokhuis Netherlands	14	443 1.3×	122 0.4×	389 3.4×	60 0.5×	462 4.4×	55	656
Levon H. Khachatrian Germany	10	100 0.3×	303 0.9×	185 1.6×	56 0.5×	372 3.6×	22	523
Geoff Whittle New Zealand	17	129 0.4×	777 2.3×	309 2.7×	220 2.0×	238 2.3×	95	930
Simeon Ball Spain	16	576 1.7×	130 0.4×	427 3.7×	164 1.5×	404 3.9×	54	732

Countries citing papers authored by Zeev Dvir

Since Specialization

Citations

This map shows the geographic impact of Zeev Dvir's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Zeev Dvir with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Zeev Dvir more than expected).

Fields of papers citing papers by Zeev Dvir

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Zeev Dvir. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Zeev Dvir. The network helps show where Zeev Dvir may publish in the future.

Co-authorship network of co-authors of Zeev Dvir

This figure shows the co-authorship network connecting the top 25 collaborators of Zeev Dvir. A scholar is included among the top collaborators of Zeev Dvir based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Zeev Dvir. Zeev Dvir is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Dvir, Zeev, et al.. (2024). Linear Hashing with $\ell_\infty$ guarantees and two-sided Kakeya bounds. SHILAP Revista de lepidopterología. Volume 3.

2.

Dvir, Zeev, et al.. (2023). Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg–Erman Proof. Discrete & Computational Geometry. 71(2). 327–357.

3.

Dvir, Zeev & Allen P. Liu. (2020). . Theory of Computing. 16(1). 1–48. 3 indexed citations

4.

Dvir, Zeev, et al.. (2020). \nA Sauer–Shelah–Perles Lemma for Lattices. Radboud Repository (Radboud University). 2 indexed citations

5.

Briët, Jop, Zeev Dvir, & Sivakanth Gopi. (2019). . Theory of Computing. 15(1). 1–24. 3 indexed citations

6.

Dvir, Zeev, et al.. (2019). . Theory of Computing. 15(1). 1–7. 5 indexed citations

7.

Dvir, Zeev, Shubhangi Saraf, & Avi Wigderson. (2017). . Theory of Computing. 13(1). 1–36. 3 indexed citations

8.

Dvir, Zeev & Guang‐Da Hu. (2016). Sylvester–Gallai for Arrangements of Subspaces. Discrete & Computational Geometry. 56(4). 940–965. 1 indexed citations

9.

Bhattacharyya, Arnab, Zeev Dvir, Shubhangi Saraf, & Amir Shpilka. (2015). Tight lower bounds for linear 2-query LCCs over finite fields. COMBINATORICA. 36(1). 1–36. 4 indexed citations

10.

Bogdanov, Andrej, Zeev Dvir, Elad Verbin, & Amir Yehudayoff. (2013). . Theory of Computing. 9(1). 283–293. 12 indexed citations

11.

Barak, Boaz, Zeev Dvir, Avi Wigderson, & Amir Yehudayoff. (2012). Fractional Sylvester–Gallai theorems. Proceedings of the National Academy of Sciences. 110(48). 19213–19219. 11 indexed citations

12.

Dvir, Zeev & Amir Shpilka. (2011). . Theory of Computing. 7(1). 1–18. 4 indexed citations

13.

Dvir, Zeev, Parikshit Gopalan, & Sergey Yekhanin. (2011). Matching Vector Codes. SIAM Journal on Computing. 40(4). 1154–1178. 26 indexed citations

14.

Dvir, Zeev & Avi Wigderson. (2010). . Theory of Computing. 6(1). 291–308. 10 indexed citations

15.

Dvir, Zeev & Avi Wigderson. (2009). Monotone expanders - constructions and applications.. Electronic colloquium on computational complexity. 16. 135. 1 indexed citations

16.

Bogdanov, Andrej, Zeev Dvir, Elad Verbin, & Amir Yehudayoff. (2009). Pseudorandomness for Width 2 Branching Programs.. Electronic colloquium on computational complexity. 16. 70. 4 indexed citations

17.

Dvir, Zeev. (2008). On the size of Kakeya sets in finite fields. Journal of the American Mathematical Society. 22(4). 1093–1097. 81 indexed citations

18.

Dvir, Zeev. (2008). Deterministic Extractors for Algebraic Sources. Electronic colloquium on computational complexity. 15. 1 indexed citations

19.

Dvir, Zeev & Amir Shpilka. (2007). An Improved Analysis of Linear Mergers. Computational Complexity. 16(1). 34–59. 7 indexed citations

20.

Hourvitz, Ariel, Yoram Epstein, Zeev Dvir, et al.. (1993). The relationship between short-term antibiotic treatments and fatigue in healthy individuals. European Journal of Applied Physiology. 66(4). 372–375. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact