Tom Gur

498 total citations
27 papers, 172 citations indexed

About

Tom Gur is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Molecular Biology. According to data from OpenAlex, Tom Gur has authored 27 papers receiving a total of 172 indexed citations (citations by other indexed papers that have themselves been cited), including 21 papers in Artificial Intelligence, 20 papers in Computational Theory and Mathematics and 4 papers in Molecular Biology. Recurrent topics in Tom Gur's work include Complexity and Algorithms in Graphs (15 papers), Cryptography and Data Security (9 papers) and Machine Learning and Algorithms (8 papers). Tom Gur is often cited by papers focused on Complexity and Algorithms in Graphs (15 papers), Cryptography and Data Security (9 papers) and Machine Learning and Algorithms (8 papers). Tom Gur collaborates with scholars based in United States, Israel and United Kingdom. Tom Gur's co-authors include Bogdan Paşaniuc, Eran Halperin, Noah Zaitlen, Elad Ziv, Ron D. Rothblum, Clément L. Canonne, Ram Avinery, Christine F. Skibola, Paige M. Bracci and Ran Raz and has published in prestigious journals such as The American Journal of Human Genetics, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Tom Gur

22 papers receiving 167 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
Tom Gur United States	6	90	59	47	39	17	27	172
Vida Ravanmehr United States	5	58 0.6×	57 1.0×	21 0.4×	110 2.8×	15 0.9×	15	168
Till Tantau Germany	7	27 0.3×	42 0.7×	78 1.7×	28 0.7×	14 0.8×	33	124
Avivit Levy Israel	7	24 0.3×	110 1.9×	49 1.0×	60 1.5×	8 0.5×	32	125
Ian McQuillan Canada	8	15 0.2×	72 1.2×	71 1.5×	154 3.9×	8 0.5×	58	235
Victor Mitrana Spain	7	25 0.3×	91 1.5×	93 2.0×	148 3.8×	8 0.5×	23	175
Siu On Chan United States	5	16 0.2×	33 0.6×	76 1.6×	12 0.3×	25 1.5×	13	117
Hansheng Xue China	9	29 0.3×	46 0.8×	29 0.6×	181 4.6×	4 0.2×	16	239
Hongyu Kang China	8	18 0.2×	20 0.3×	26 0.6×	48 1.2×	47 2.8×	15	160
Boting Yang Canada	6	25 0.3×	17 0.3×	65 1.4×	29 0.7×	32 1.9×	28	115
Philippe Collard France	7	24 0.3×	131 2.2×	63 1.3×	23 0.6×	4 0.2×	11	157

Countries citing papers authored by Tom Gur

Since Specialization

Citations

This map shows the geographic impact of Tom Gur'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 Tom Gur with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tom Gur more than expected).

Fields of papers citing papers by Tom Gur

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Tom Gur. 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 Tom Gur. The network helps show where Tom Gur may publish in the future.

Co-authorship network of co-authors of Tom Gur

This figure shows the co-authorship network connecting the top 25 collaborators of Tom Gur. A scholar is included among the top collaborators of Tom Gur 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 Tom Gur. Tom Gur 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.

Gur, Tom, Jack O’Connor, & Nicholas Spooner. (2024). Perfect Zero-Knowledge PCPs for #P. 1724–1730.

2.

Golovnev, Alexander, et al.. (2022). Worst-case to average-case reductions via additive combinatorics. Warwick Research Archive Portal (University of Warwick). 1566–1574. 4 indexed citations

3.

Gur, Tom, et al.. (2022). Quantum Proofs of Proximity. Quantum. 6. 834–834.

4.

Gur, Tom, et al.. (2021). A Structural Theorem for Local Algorithms with Applications to Coding, Testing, and Delegation. Symposium on Discrete Algorithms. 1651–1665. 1 indexed citations

5.

Gur, Tom & Oded Lachish. (2021). On the Power of Relaxed Local Decoding Algorithms. SIAM Journal on Computing. 50(2). 788–813. 4 indexed citations

6.

Goldreich, Oded & Tom Gur. (2021). Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP. Theoretical Computer Science. 878-879. 83–101. 1 indexed citations

7.

Gur, Tom, et al.. (2020). . Theory of Computing. 16(1). 1–68. 6 indexed citations

8.

Dinur, Irit, Oded Goldreich, & Tom Gur. (2019). Every Set in P Is Strongly Testable Under a Suitable Encoding. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 25. 17. 3 indexed citations

9.

Canonne, Clément L. & Tom Gur. (2018). An adaptivity hierarchy theorem for property testing. Computational Complexity. 27(4). 671–716. 7 indexed citations

10.

Gur, Tom, et al.. (2018). . 24(1). 1–21. 2 indexed citations

11.

Chiesa, Alessandro & Tom Gur. (2017). Proofs of Proximity for Distribution Testing.. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 24. 155.

12.

Gur, Tom & Ron D. Rothblum. (2017). A Hierarchy Theorem for Interactive Proofs of Proximity. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 67. 43. 4 indexed citations

13.

Blais, Eric, Clément L. Canonne, & Tom Gur. (2017). Distribution testing lower bounds via reductions from communication complexity. 40. 2 indexed citations

14.

Goldreich, Oded & Tom Gur. (2016). Universal Locally Testable Codes.. Electronic colloquium on computational complexity. 2018. 42. 1 indexed citations

15.

Goldreich, Oded, Tom Gur, & Ron D. Rothblum. (2015). Proofs of Proximity for Context-Free Languages and Read-Once Branching Programs (Extended Abstract). Apollo (University of Cambridge). 666–677. 2 indexed citations

16.

Gur, Tom & Ron D. Rothblum. (2015). Non-Interactive Proofs of Proximity. 133–142. 7 indexed citations

17.

Gur, Tom & Ran Raz. (2014). Arthur–Merlin streaming complexity. Information and Computation. 243. 145–165. 5 indexed citations

18.

Gur, Tom & Omer Tamuz. (2012). Testing Booleanity and the Uncertainty Principle. arXiv (Cornell University). 19. 31. 2 indexed citations

19.

Zaitlen, Noah, Bogdan Paşaniuc, Tom Gur, Elad Ziv, & Eran Halperin. (2010). Leveraging Genetic Variability across Populations for the Identification of Causal Variants. The American Journal of Human Genetics. 86(1). 23–33. 90 indexed citations

20.

Paşaniuc, Bogdan, Ram Avinery, Tom Gur, et al.. (2010). A generic coalescent‐based framework for the selection of a reference panel for imputation. Genetic Epidemiology. 34(8). 773–782. 16 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