John Noga

2009
37	EE	Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs CoRR abs/0904.1002: (2009)
2008
36	EE	Wolfgang W. Bein, John Noga, Jeff Wiegley: Priority Approximation for Batching. HICSS 2008: 477
35	EE	Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Incremental Medians via Online Bidding. Algorithmica 50(4): 455-478 (2008)
2007
34	EE	Wolfgang W. Bein, Lawrence L. Larmore, John Noga: Equitable Revisited. ESA 2007: 419-426
33	EE	Wolfgang W. Bein, Lawrence L. Larmore, John Noga: Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104(4): 123-128 (2007)
2006
32	EE	Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians Via Online Bidding. LATIN 2006: 311-322
2005
31	EE	Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga: The Delayed k-Server Problem. FCT 2005: 281-292
30	EE	John Noga, Veerawan Sarbua: An Online Partially Fractional Knapsack Problem. ISPAN 2005: 108-112
29	EE	Wolfgang W. Bein, Lawrence L. Larmore, John Noga: A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN 2005: 94-99
28	EE	G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley: Experiments with balanced-sample binary trees. SIGCSE 2005: 166-170
27	EE	Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger: A Note on Semi-online Machine Covering. WAOA 2005: 110-118
26	EE	Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians via Online Bidding CoRR abs/cs/0504103: (2005)
25	EE	Dirk Wagner, John Noga: Random Walks with Anti-Correlated Steps CoRR abs/cs/0512043: (2005)
2004
24	EE	Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally Competitive List Batching. SWAT 2004: 77-89
2003
23	EE	Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut: Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003)
22	EE	Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania: Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67(1): 183-197 (2003)
21		Marek Chrobak, Elias Koutsoupias, John Noga: More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003)
2002
20	EE	Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania: Preemptive Scheduling in Overloaded Systems. ICALP 2002: 800-811
19	EE	Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. Algorithmica 33(3): 353-370 (2002)
18	EE	John Noga, Steven S. Seiden, Gerhard J. Woeginger: A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. 81(2): 71-73 (2002)
17	EE	Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan: More on random walks, electrical networks, and the harmonic k-server algorithm. Inf. Process. Lett. 84(5): 271-276 (2002)
16	EE	Leah Epstein, John Noga, Gerhard J. Woeginger: On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. 30(6): 415-420 (2002)
15		Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger: Solution of a problem in DNA computing. Theor. Comput. Sci. 287(2): 387-391 (2002)
2001
14	EE	János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger: Buying a Constant Competitive Ratio for Paging. ESA 2001: 98-108
13	EE	Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger: The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP 2001: 862-874
12	EE	John Noga, Steven S. Seiden: An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. 268(1): 133-143 (2001)
2000
11	EE	Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. SWAT 2000: 150-163
10		Marek Chrobak, John Noga: Competitive Algorithms for Relaxed List Update and Multilevel Caching. J. Algorithms 34(2): 282-308 (2000)
9	EE	Dimitris Achlioptas, Marek Chrobak, John Noga: Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234(1-2): 203-218 (2000)
1999
8	EE	John Noga, Steven S. Seiden: Scheduling Two Machines with Release Times. IPCO 1999: 391-399
7		Csanád Imreh, John Noga: Scheduling with Machine Cost. RANDOM-APPROX 1999: 168-176
6	EE	Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326
5	EE	Marek Chrobak, John Noga: LRU Is Better than FIFO. Algorithmica 23(2): 180-185 (1999)
1998
4		Marek Chrobak, John Noga: LRU is Better than FIFO. SODA 1998: 78-81
3		Marek Chrobak, John Noga: Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). SODA 1998: 87-96
1996
2		Dimitris Achlioptas, Marek Chrobak, John Noga: Competive Analysis of Randomized Paging Algorithms. ESA 1996: 419-430
1		Marek Chrobak, John Noga: Bibliography on Competitive Algorithms. Online Algorithms 1996: 395-436

Coauthor Index

1	Dimitris Achlioptas	[2] [9]
2	Eric Anderson	[15]
3	G. Michael Barnes	[28]
4	Yair Bartal	[17]
5	Wolfgang W. Bein	[24] [29] [31] [33] [34] [36] [37]
6	Marek Chrobak	[1] [2] [3] [4] [5] [9] [10] [13] [15] [17] [20] [21] [22] [26] [32] [35]
7	János Csirik	[13] [14]
8	Tomás Ebenlendr	[27]
9	Leah Epstein	[6] [16] [20] [22] [24] [37]
10	Csanád Imreh	[7] [13] [14]
11	Kazuo Iwama	[31]
12	Bala Kalyanasundaram	[11] [19]
13	Jens S. Kohrt (Jens S. Frederiksen)	[23]
14	Elias Koutsoupias	[21]
15	Lawrence L. Larmore	[24] [29] [31] [33] [34] [37]
16	Kim S. Larsen	[23]
17	Claire Mathieu (Claire Kenyon, Claire Kenyon-Mathieu)	[26] [32] [35]
18	Kirk Pruhs	[11] [19]
19	Prabhakar Raghavan	[17]
20	Veerawan Sarbua	[30]
21	Steven S. Seiden	[6] [8] [12] [14] [18]
22	Jiri Sgall	[6] [13] [15] [20] [22] [27]
23	Peter D. Smith	[28]
24	Rob van Stee	[20] [22]
25	Tomás Tichý	[20] [22]
26	Patchrawat Uthaisombut	[23]
27	Nodari Vakhania	[20] [22]
28	Dirk Wagner	[25]
29	Jeff Wiegley	[28] [36]
30	Gerhard J. Woeginger	[6] [11] [13] [14] [15] [16] [18] [19] [27]
31	Neal E. Young	[26] [32] [35]

Colors in the list of coauthors