John Noga

807 total citations
24 papers, 371 citations indexed

About

John Noga is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Computational Theory and Mathematics. According to data from OpenAlex, John Noga has authored 24 papers receiving a total of 371 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Computer Networks and Communications, 7 papers in Industrial and Manufacturing Engineering and 6 papers in Computational Theory and Mathematics. Recurrent topics in John Noga's work include Optimization and Search Problems (22 papers), Scheduling and Optimization Algorithms (7 papers) and Caching and Content Delivery (6 papers). John Noga is often cited by papers focused on Optimization and Search Problems (22 papers), Scheduling and Optimization Algorithms (7 papers) and Caching and Content Delivery (6 papers). John Noga collaborates with scholars based in United States, Austria and Israel. John Noga's co-authors include Marek Chrobák, Gerhard J. Woeginger, Leah Epstein, Dimitris Achlioptas, Jiřı́ Sgall, Steven S. Seiden, Claire Kenyon, Neal E. Young, Tomáš Tichý and Nodari Vakhania and has published in prestigious journals such as SHILAP Revista de lepidopterología, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

John Noga

22 papers receiving 348 citations

Peers — A (Enhanced Table)

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

Name	h						Papers	Cites
John Noga United States	10	326	177	69	47	31	24	371
Lene M. Favrholdt Denmark	11	300 0.9×	174 1.0×	87 1.3×	55 1.2×	40 1.3×	37	351
Stanley P. Y. Fung Hong Kong	9	258 0.8×	70 0.4×	26 0.4×	56 1.2×	34 1.1×	23	307
Belaïd Benhamou France	9	99 0.3×	51 0.3×	50 0.7×	50 1.1×	100 3.2×	45	249
Derrell V. Foster United States	5	393 1.2×	28 0.2×	22 0.3×	25 0.5×	21 0.7×	7	411
Bruno Baynat France	10	109 0.3×	127 0.7×	29 0.4×	36 0.8×	15 0.5×	27	285
Zeynep Kiziltan Italy	10	175 0.5×	40 0.2×	41 0.6×	46 1.0×	120 3.9×	37	272
Chenchen Wu China	8	97 0.3×	121 0.7×	16 0.2×	44 0.9×	20 0.6×	53	230
Jin Hyun Son South Korea	9	134 0.4×	37 0.2×	20 0.3×	10 0.2×	44 1.4×	37	254
Vahid Liaghat United States	7	137 0.4×	8 0.0×	71 1.0×	51 1.1×	25 0.8×	16	182
Stefan Dobrev Canada	12	324 1.0×	16 0.1×	30 0.4×	65 1.4×	30 1.0×	55	387

Countries citing papers authored by John Noga

Since Specialization

Citations

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

Fields of papers citing papers by John Noga

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of John Noga

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

Bein, Wolfgang, Lawrence L. Larmore, John Noga, & Rüdiger Reischuk. (2009). Knowledge State Algorithms. Algorithmica. 60(3). 653–678. 4 indexed citations

Bein, Wolfgang, et al.. (2008). Priority Approximation for Batching. 477–477. 1 indexed citations

Bein, Wolfgang, Lawrence L. Larmore, & John Noga. (2007). Uniform metrical task systems with a limited number of states. Information Processing Letters. 104(4). 123–128. 2 indexed citations

Chrobák, Marek, Claire Kenyon, John Noga, & Neal E. Young. (2007). Incremental Medians via Online Bidding. Algorithmica. 50(4). 455–478. 19 indexed citations

Noga, John, et al.. (2006). An Online Partially Fractional Knapsack Problem. 108–112. 17 indexed citations

Noga, John, et al.. (2005). Experiments with balanced-sample binary trees. ACM SIGCSE Bulletin. 37(1). 166–170. 5 indexed citations

Chrobák, Marek, Ηλίας Κουτσουπιάς, & John Noga. (2003). More on randomized on-line algorithms for caching. Theoretical Computer Science. 290(3). 1997–2008. 4 indexed citations

Chrobák, Marek, Leah Epstein, John Noga, et al.. (2003). Preemptive scheduling in overloaded systems. Journal of Computer and System Sciences. 67(1). 183–197. 19 indexed citations

Epstein, Leah, John Noga, & Gerhard J. Woeginger. (2002). On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Operations Research Letters. 30(6). 415–420. 53 indexed citations

10.

Noga, John, et al.. (2002). A faster off-line algorithm for the TCP acknowledgement problem. Information Processing Letters. 81(2). 71–73. 6 indexed citations

11.

Anderson, Eric, Marek Chrobák, John Noga, Jiřı́ Sgall, & Gerhard J. Woeginger. (2002). Solution of a problem in DNA computing. Theoretical Computer Science. 287(2). 387–391. 5 indexed citations

12.

Bartal, Yair, Marek Chrobák, John Noga, & Prabhakar Raghavan. (2002). More on random walks, electrical networks, and the harmonic -server algorithm. Information Processing Letters. 84(5). 271–276. 9 indexed citations

13.

Noga, John & Steven S. Seiden. (2001). An optimal online algorithm for scheduling two machines with release times. Theoretical Computer Science. 268(1). 133–143. 20 indexed citations

14.

Epstein, Leah, et al.. (2001). Randomized on-line scheduling on two uniform machines. Journal of Scheduling. 4(2). 71–92. 64 indexed citations

15.

Achlioptas, Dimitris, Marek Chrobák, & John Noga. (2000). Competitive analysis of randomized paging algorithms. Theoretical Computer Science. 234(1-2). 203–218. 68 indexed citations

16.

Chrobák, Marek & John Noga. (2000). Competitive Algorithms for Relaxed List Update and Multilevel Caching. Journal of Algorithms. 34(2). 282–308. 5 indexed citations

17.

Epstein, Leah, et al.. (1999). Randomized online scheduling on two uniform machines. University of Twente Research Information. 317–326. 6 indexed citations

18.

Chrobák, Marek & John Noga. (1998). LRU is better than FIFO. Symposium on Discrete Algorithms. 78–81. 14 indexed citations

19.

Chrobák, Marek & John Noga. (1998). Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract).. Symposium on Discrete Algorithms. 87–96. 1 indexed citations

20.

Chrobák, Marek & John Noga. (1998). Competitive algorithms for multilevel caching and relaxed list update. Symposium on Discrete Algorithms. 87–96. 4 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