Nick Reingold

1.7k total citations
26 papers, 1.0k citations indexed

About

Nick Reingold is a scholar working on Computer Networks and Communications, Computational Theory and Mathematics and Electrical and Electronic Engineering. According to data from OpenAlex, Nick Reingold has authored 26 papers receiving a total of 1.0k indexed citations (citations by other indexed papers that have themselves been cited), including 19 papers in Computer Networks and Communications, 11 papers in Computational Theory and Mathematics and 6 papers in Electrical and Electronic Engineering. Recurrent topics in Nick Reingold's work include Optimization and Search Problems (12 papers), Complexity and Algorithms in Graphs (11 papers) and Network Traffic and Congestion Control (6 papers). Nick Reingold is often cited by papers focused on Optimization and Search Problems (12 papers), Complexity and Algorithms in Graphs (11 papers) and Network Traffic and Congestion Control (6 papers). Nick Reingold collaborates with scholars based in United States, France and India. Nick Reingold's co-authors include Carsten Lund, Jennifer Rexford, Anja Feldmann, Albert Greenberg, Daniel A. Spielman, Richard Beigel, Jeffery Westbrook, Daniel D. Sleator, Steven Phillips and Lance Fortnow and has published in prestigious journals such as IEEE Journal on Selected Areas in Communications, IEEE/ACM Transactions on Networking and ACM SIGCOMM Computer Communication Review.

In The Last Decade

Nick Reingold

26 papers receiving 941 citations

Peers

Nick Reingold

CNC

AI

EEE

CTM

HA

Shmuel Zaks Israel

Y. Bartal Israel

Bala Kalyanasundaram United States

Jeffery Westbrook United States

Amos Israeli Israel

Udi Wieder United States

Amitabha Roy United States

Sandeep Sen India

Stephen Suen United States

Mark W. Krentel United States

Shmuel Zaks Israel

Nick Reingold

691 ×0.9

CNC

215 ×0.5

AI

310 ×1.3

EEE

407 ×1.8

CTM

115 ×1.3

HA

Citations per year, relative to Nick Reingold Nick Reingold (= 1×) peers Shmuel Zaks

Countries citing papers authored by Nick Reingold

Since Specialization

Citations

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

Fields of papers citing papers by Nick Reingold

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Nick Reingold

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

1.

Buchsbaum, Adam L., Howard Karloff, Claire Kenyon, Nick Reingold, & Mikkel Thorup. (2003). OPT versus LOAD in dynamic storage allocation. 1 indexed citations

2.

Phillips, Steven J., Nick Reingold, & Robert Doverspike. (2003). Network studies in IP/optical layer restoration. 425–427. 17 indexed citations

3.

Buchsbaum, Adam L., Howard Karloff, Claire Kenyon, Nick Reingold, & Mikkel Thorup. (2003). OPT versus LOAD in dynamic storage allocation. 556–564. 9 indexed citations

4.

Fortnow, Lance & Nick Reingold. (2002). PP is closed under truth-table reductions. 13–15. 9 indexed citations

5.

Lund, Carsten, Steven Phillips, & Nick Reingold. (2002). Adaptive holding policies for IP over ATM networks. 80–87. 3 indexed citations

6.

Lund, Carsten, Steven Phillips, & Nick Reingold. (2002). IP over connection-oriented networks and distributional paging. 424–434. 7 indexed citations

7.

Beigel, Richard, Nick Reingold, & Daniel A. Spielman. (2002). The perceptron strikes back. 286–291. 29 indexed citations

8.

Feldmann, Anja, et al.. (2000). Deriving traffic demands for operational IP networks. ACM SIGCOMM Computer Communication Review. 30(4). 257–270. 74 indexed citations

9.

Feldmann, Anja, Albert Greenberg, Carsten Lund, Nick Reingold, & Jennifer Rexford. (2000). NetScope: traffic engineering for IP networks. IEEE Network. 14(2). 11–19. 156 indexed citations

10.

Feldmann, Anja, et al.. (2000). Deriving traffic demands for operational IP networks. 257–270. 51 indexed citations

11.

Lund, Carsten, Steven Phillips, & Nick Reingold. (1999). Paging against a Distribution and IP Networking. Journal of Computer and System Sciences. 58(1). 222–231. 4 indexed citations

12.

Lund, Carsten, et al.. (1998). Competitive On-Line Algorithms for Distributed Data Management. SIAM Journal on Computing. 28(3). 1086–1111. 16 indexed citations

13.

Chrobák, Marek, Lawrence L. Larmore, Nick Reingold, & Jeffery Westbrook. (1997). Page Migration Algorithms Using Work Functions. Journal of Algorithms. 24(1). 124–157. 15 indexed citations

14.

Chrobák, Marek, Lawrence L. Larmore, Carsten Lund, & Nick Reingold. (1997). A better lower bound on the competitive ratio of the randomized 2-server problem. Information Processing Letters. 63(2). 79–83. 13 indexed citations

15.

Reingold, Nick & Jeffery Westbrook. (1996). Off-line algorithms for the list update problem. Information Processing Letters. 60(2). 75–80. 9 indexed citations

16.

Lund, Carsten, Steven Phillips, & Nick Reingold. (1996). Fair prioritized scheduling in an input-buffered switch. 8. 358–369. 4 indexed citations

17.

Fortnow, Lance & Nick Reingold. (1996). PP Is Closed under Truth-Table Reductions. Information and Computation. 124(1). 1–6. 14 indexed citations

18.

Broder, Andrei, Alan Frieze, Carsten Lund, Steven Phillips, & Nick Reingold. (1995). Balanced allocations for tree-like inputs. Information Processing Letters. 55(6). 329–332. 7 indexed citations

19.

Beigel, Richard, Nick Reingold, & Daniel A. Spielman. (1995). PP Is Closed under Intersection. Journal of Computer and System Sciences. 50(2). 191–202. 58 indexed citations

20.

Lund, Carsten & Nick Reingold. (1994). Linear programs for randomized on-line algorithms. Symposium on Discrete Algorithms. 382–391. 8 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