John Noga

Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk: Knowledge State Algorithms. Algorithmica 60(3): 653-678 (2011)

Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009)

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)

Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Incremental Medians via Online Bidding. Algorithmica 50(4): 455-478 (2008)

Wolfgang W. Bein, John Noga, Jeff Wiegley: Priority Approximation for Batching. HICSS 2008: 477

Wolfgang W. Bein, John Noga, Jeff Wiegley: Approximation for Batching via Priorities. Sci. Ann. Comp. Sci. 17: 1-18 (2007)

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)

Wolfgang W. Bein, Lawrence L. Larmore, John Noga: Equitable Revisited. ESA 2007: 419-426

Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians Via Online Bidding. LATIN 2006: 311-322

Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga: The Delayed k-Server Problem. FCT 2005: 281-292

Wolfgang W. Bein, Lawrence L. Larmore, John Noga: A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN 2005: 94-99

John Noga, Veerawan Sarbua: An Online Partially Fractional Knapsack Problem. ISPAN 2005: 108-112

G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley: Experiments with balanced-sample binary trees. SIGCSE 2005: 166-170

Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger: A Note on Semi-online Machine Covering. WAOA 2005: 110-118

Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young: Oblivious Medians via Online Bidding. CoRR abs/cs/0504103 (2005)

Dirk Wagner, John Noga: Random Walks with Anti-Correlated Steps. CoRR abs/cs/0512043 (2005)

Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga: Optimally Competitive List Batching. SWAT 2004: 77-89

Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut: Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003)

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)

Marek Chrobak, Elias Koutsoupias, John Noga: More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003)

Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. Algorithmica 33(3): 353-370 (2002)

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)

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)

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)

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)

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

John Noga, Steven S. Seiden: An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. 268(1): 133-143 (2001)

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

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

Marek Chrobak, John Noga: Competitive Algorithms for Relaxed List Update and Multilevel Caching. J. Algorithms 34(2): 282-308 (2000)

Dimitris Achlioptas, Marek Chrobak, John Noga: Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234(1-2): 203-218 (2000)

Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger: Caching for Web Searching. SWAT 2000: 150-163

Marek Chrobak, John Noga: LRU Is Better than FIFO. Algorithmica 23(2): 180-185 (1999)

John Noga, Steven S. Seiden: Scheduling Two Machines with Release Times. IPCO 1999: 391-399

Csanád Imreh, John Noga: Scheduling with Machine Cost. RANDOM-APPROX 1999: 168-176

Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger: Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326

Marek Chrobak, John Noga: LRU is Better than FIFO. SODA 1998: 78-81

Marek Chrobak, John Noga: Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). SODA 1998: 87-96

Marek Chrobak, John Noga: Bibliography on Competitive Algorithms. Online Algorithms 1996: 395-436

Dimitris Achlioptas, Marek Chrobak, John Noga: Competive Analysis of Randomized Paging Algorithms. ESA 1996: 419-430