Edward M. Reingold

10.2k total citations · 2 hit papers
76 papers, 6.4k citations indexed

About

Edward M. Reingold is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Edward M. Reingold has authored 76 papers receiving a total of 6.4k indexed citations (citations by other indexed papers that have themselves been cited), including 25 papers in Artificial Intelligence, 24 papers in Computational Theory and Mathematics and 19 papers in Computer Networks and Communications. Recurrent topics in Edward M. Reingold's work include Algorithms and Data Compression (19 papers), Optimization and Search Problems (10 papers) and graph theory and CDMA systems (9 papers). Edward M. Reingold is often cited by papers focused on Algorithms and Data Compression (19 papers), Optimization and Search Problems (10 papers) and graph theory and CDMA systems (9 papers). Edward M. Reingold collaborates with scholars based in United States, France and Israel. Edward M. Reingold's co-authors include Narsingh Deo, Jürg Nievergelt, J. Bitner, J. Nievergelt, Tony Greenfield, Kenneth J. Supowit, Gideon Ehrlich, Laurent Alonso, Nachum Dershowitz and Robert E. Tarjan and has published in prestigious journals such as IEEE Transactions on Information Theory, Communications of the ACM and Mathematics of Computation.

In The Last Decade

Edward M. Reingold

70 papers receiving 5.9k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Graph drawing by force‐directed placement

1991 3.9k citations Edward M. Reingold et al. Software Practice and Experience profile →
Combinatorial Algorithms: Theory and Practice

1977 445 citations Edward M. Reingold, Jürg Nievergelt et al. profile →

Author Peers

Peers are selected by citation overlap in the author's most active subfields. citations · hero ref

Author						Papers	Cites
Edward M. Reingold	1.6k	1.4k	957	899	877	76	6.4k
Lawrence J. Hubert	1.5k 0.9×	3.8k 2.7×	599 0.6×	308 0.3×	1.2k 1.4×	149	11.0k
Ulrik Brandes	1.3k 0.8×	1.4k 1.0×	606 0.6×	1.3k 1.4×	3.4k 3.9×	139	8.1k
Phipps Arabie	1.4k 0.9×	3.6k 2.6×	470 0.5×	244 0.3×	1.3k 1.4×	61	9.0k
Melanie Mitchell	937 0.6×	3.7k 2.6×	1.6k 1.6×	1.1k 1.2×	371 0.4×	86	11.3k
Richard A. Harshman	1.8k 1.1×	6.3k 4.5×	576 0.6×	750 0.8×	666 0.8×	56	12.7k
Ingwer Borg	1.1k 0.7×	1.2k 0.8×	304 0.3×	306 0.3×	280 0.3×	95	7.0k
A. P. Dempster	899 0.5×	4.1k 3.0×	1.0k 1.1×	548 0.6×	335 0.4×	67	10.9k
Illés J. Farkas	975 0.6×	1.2k 0.9×	728 0.8×	1.2k 1.3×	3.3k 3.8×	42	10.3k
S. C. Johnson	524 0.3×	2.1k 1.5×	637 0.7×	697 0.8×	216 0.2×	53	5.7k
Kevin Lang	1.1k 0.7×	3.4k 2.4×	386 0.4×	1.3k 1.4×	2.2k 2.5×	132	11.2k

Countries citing papers authored by Edward M. Reingold

Since Specialization

Citations

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

Fields of papers citing papers by Edward M. Reingold

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Edward M. Reingold

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

Reingold, Edward M. & Nachum Dershowitz. (2018). Calendrical Calculations. Cambridge University Press eBooks. 10 indexed citations

Dershowitz, Nachum & Edward M. Reingold. (2012). Modulo intervals. ACM SIGACT News. 43(3). 60–64. 2 indexed citations

Alonso, Laurent & Edward M. Reingold. (2010). Bounds for cops and robber pursuit. Computational Geometry. 43(9). 749–766. 2 indexed citations

Harris, Mitchell A. & Edward M. Reingold. (2004). Line drawing, leap years, and Euclid. ACM Computing Surveys. 36(1). 68–80. 13 indexed citations

Reingold, Edward M., et al.. (2000). A potential-based amortized analysis of the union-find data structure. ACM SIGACT News. 31(3). 86–95. 4 indexed citations

Dershowitz, Nachum, et al.. (1999). Calendrical Calculations. The Mathematical Gazette. 83(496). 159–159. 13 indexed citations

Berger‐Wolf, Tanya & Edward M. Reingold. (1999). Optimal multichannel communication under failure. Symposium on Discrete Algorithms. 858–859. 2 indexed citations

Reingold, Edward M., et al.. (1997). K-M-P string matching revisited. Information Processing Letters. 64(5). 217–223. 3 indexed citations

Reingold, Edward M., et al.. (1995). The complexity of pursuit on a graph. Theoretical Computer Science. 143(1). 93–112. 42 indexed citations

10.

Reingold, Edward M., et al.. (1995). Letters to the editor. The Mathematical Intelligencer. 17(3). 3–5.

11.

Dershowitz, Nachum & Edward M. Reingold. (1992). Ordinal Arithmetic with List Structures. 117–126. 3 indexed citations

12.

Alonso, Laurent, et al.. (1992). “Lion and Man”: Upper and Lower Bounds. INFORMS Journal on Computing. 4(4). 447–452. 34 indexed citations

13.

Reingold, Edward M., et al.. (1991). Graph drawing by force‐directed placement. Software Practice and Experience. 21(11). 1129–1164. 3941 indexed citations breakdown →

14.

Wong, Martin D. F. & Edward M. Reingold. (1991). Probabilistic analysis of a grouping algorithm. Algorithmica. 6(1-6). 192–206.

15.

Dershowitz, Nachum & Edward M. Reingold. (1990). Calendrical calculations. Software Practice and Experience. 20(9). 899–928. 39 indexed citations

16.

Reingold, Edward M.. (1979). A Note on 3-2 Trees. The Fibonacci quarterly. 17(2). 151–157. 1 indexed citations

17.

Nievergelt, Jürg & Edward M. Reingold. (1973). Automating introductory computer science courses. ACM SIGCSE Bulletin. 5(1). 24–25. 1 indexed citations

18.

Nievergelt, Jürg & Edward M. Reingold. (1973). Automating introductory computer science courses. 24–25. 4 indexed citations

19.

Nievergelt, J. & Edward M. Reingold. (1973). Binary Search Trees of Bounded Balance. SIAM Journal on Computing. 2(1). 33–43. 164 indexed citations

20.

Nievergelt, J. & Edward M. Reingold. (1972). Binary search trees of bounded balance. 137–142. 28 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