John Rompel

1.5k total citations
10 papers, 633 citations indexed

About

John Rompel is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Graphics and Computer-Aided Design. According to data from OpenAlex, John Rompel has authored 10 papers receiving a total of 633 indexed citations (citations by other indexed papers that have themselves been cited), including 9 papers in Computational Theory and Mathematics, 7 papers in Artificial Intelligence and 4 papers in Computer Graphics and Computer-Aided Design. Recurrent topics in John Rompel's work include Complexity and Algorithms in Graphs (8 papers), Cryptography and Data Security (4 papers) and Computational Geometry and Mesh Generation (4 papers). John Rompel is often cited by papers focused on Complexity and Algorithms in Graphs (8 papers), Cryptography and Data Security (4 papers) and Computational Geometry and Mesh Generation (4 papers). John Rompel collaborates with scholars based in United States. John Rompel's co-authors include Bonnie Berger, Lance Fortnow, Michael Sipser, Mihir Bellare, M. Sipser and Peter W. Shor and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

John Rompel

10 papers receiving 556 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
John Rompel United States 10 467 411 117 69 66 10 633
Martin Fürer United States 13 294 0.6× 473 1.2× 201 1.7× 47 0.7× 93 1.4× 38 744
Michal Parnas Israel 13 238 0.5× 264 0.6× 104 0.9× 97 1.4× 18 0.3× 27 411
Joel Seiferas United States 15 525 1.1× 517 1.3× 186 1.6× 27 0.4× 42 0.6× 47 827
Neeraj Kayal India 12 446 1.0× 487 1.2× 65 0.6× 44 0.6× 89 1.3× 44 710
Joos Heintz Argentina 20 277 0.6× 1.0k 2.5× 39 0.3× 22 0.3× 42 0.6× 46 1.2k
Leslie M. Goldschlager Australia 9 217 0.5× 396 1.0× 158 1.4× 47 0.7× 11 0.2× 12 530
Mauricio Karchmer Israel 14 429 0.9× 544 1.3× 141 1.2× 26 0.4× 31 0.5× 19 696
Desh Ranjan United States 10 182 0.4× 187 0.5× 186 1.6× 42 0.6× 27 0.4× 30 500
Alan Siegel United States 11 262 0.6× 230 0.6× 220 1.9× 61 0.9× 10 0.2× 34 521
Adam R. Klivans United States 19 831 1.8× 618 1.5× 108 0.9× 36 0.5× 16 0.2× 56 1.0k

Countries citing papers authored by John Rompel

Since Specialization
Citations

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

Fields of papers citing papers by John Rompel

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of John Rompel

This figure shows the co-authorship network connecting the top 25 collaborators of John Rompel. A scholar is included among the top collaborators of John Rompel 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 John Rompel. John Rompel is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

10 of 10 papers shown
1.
Bellare, Mihir & John Rompel. (2002). Randomness-efficient oblivious sampling. 276–287. 55 indexed citations
2.
Fortnow, Lance, John Rompel, & Michael Sipser. (1994). On the power of multi-prover interactive protocols. Theoretical Computer Science. 134(2). 545–557. 94 indexed citations
3.
Berger, Bonnie, John Rompel, & Peter W. Shor. (1994). Efficient NC algorithms for set cover with applications to learning and geometry. Journal of Computer and System Sciences. 49(3). 454–477. 58 indexed citations
4.
Berger, Bonnie & John Rompel. (1991). Simulating (log c n )-wise independence in NC. Journal of the ACM. 38(4). 1026–1046. 52 indexed citations
5.
Fortnow, Lance, John Rompel, & Michael Sipser. (1990). Errata for On the Power of Multi-Prover Interactive Protocols.. 318–319. 9 indexed citations
6.
Rompel, John. (1990). One-way functions are necessary and sufficient for secure signatures. 387–394. 226 indexed citations
7.
Berger, Bonnie & John Rompel. (1990). A better performance guarantee for approximate graph coloring. Algorithmica. 5(1-4). 459–466. 34 indexed citations
8.
Berger, Bonnie, John Rompel, & Peter W. Shor. (1989). Efficient NC algorithms for set cover with applications to learning and geometry. 2. 54–59. 16 indexed citations
9.
Berger, Bonnie & John Rompel. (1989). Simulating (log/sup c/n)-wise independence in NC. 2–7. 12 indexed citations
10.
Fortnow, Lance, John Rompel, & M. Sipser. (1988). On the power of multi-power interactive protocols. 156–161. 77 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

Rankless by CCL
2026