Bibliography on Competitive Algorithms. - Marek Chrobak; John Noga (Online Algorithms, 1996)

Competive Analysis of Randomized Paging Algorithms. - Dimitris Achlioptas; Marek Chrobak; John Noga (ESA, 1996)

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

Scheduling Two Machines with Release Times. - John Noga; Steven S. Seiden (IPCO, 1999)

Scheduling with Machine Cost. - Csanád Imreh; John Noga (RANDOM-APPROX, 1999)

Randomized Online Scheduling on Two Uniform Machines. - Leah Epstein; John Noga; Steven S. Seiden; Jirí Sgall; Gerhard J. Woeginger (SODA, 1999)

LRU Is Better than FIFO. - Marek Chrobak; John Noga (Algorithmica, 1999)

Competitive Algorithms for Relaxed List Update and Multilevel Caching. - Marek Chrobak; John Noga (J. Algorithms, 2000)

Competitive analysis of randomized paging algorithms. - Dimitris Achlioptas; Marek Chrobak; John Noga (Theor. Comput. Sci., 2000)

Buying a Constant Competitive Ratio for Paging. - János Csirik; Csanád Imreh; John Noga; Steven S. Seiden; Gerhard J. Woeginger (ESA, 2001)

The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. - Marek Chrobak; János Csirik; Csanád Imreh; John Noga; Jirí Sgall; Gerhard J. Woeginger (ICALP, 2001)

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

Caching for Web Searching. - Bala Kalyanasundaram; John Noga; Kirk Pruhs; Gerhard J. Woeginger (Algorithmica, 2002)

More on random walks, electrical networks, and the harmonic k-server algorithm. - Yair Bartal; Marek Chrobak; John Noga; Prabhakar Raghavan (Inf. Process. Lett., 2002)

A faster off-line algorithm for the TCP acknowledgement problem. - John Noga; Steven Seiden 001; Gerhard J. Woeginger (Inf. Process. Lett., 2002)

On-line scheduling of unit time jobs with rejection: minimizing the total completion time. - Leah Epstein; John Noga; Gerhard J. Woeginger (Oper. Res. Lett., 2002)

Solution of a problem in DNA computing. - Eric Anderson; Marek Chrobak; John Noga; Jirí Sgall; Gerhard J. Woeginger (Theor. Comput. Sci., 2002)

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

Preemptive scheduling in overloaded systems. - Marek Chrobak; Leah Epstein; John Noga; Jirí Sgall; Rob van Stee; Tomás Tichý; Nodari Vakhania (J. Comput. Syst. Sci., 2003)

More on randomized on-line algorithms for caching. - Marek Chrobak; Elias Koutsoupias; John Noga (Theor. Comput. Sci., 2003)

The Delayed k-Server Problem. - Wolfgang W. Bein; Kazuo Iwama; Lawrence L. Larmore; John Noga (FCT, 2005)

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

An Online Partially Fractional Knapsack Problem. - John Noga; Veerawan Sarbua (ISPAN, 2005)

Experiments with balanced-sample binary trees. - G. Michael Barnes; John Noga; Peter D. Smith; Jeff Wiegley (SIGCSE, 2005)

A Note on Semi-online Machine Covering. - Tomás Ebenlendr; John Noga; Jirí Sgall; Gerhard J. Woeginger (WAOA, 2005)

Random Walks with Anti-Correlated Steps - Dirk Wagner; John Noga (CoRR, 2005)

Oblivious Medians Via Online Bidding. - Marek Chrobak; Claire Kenyon; John Noga; Neal E. Young (LATIN, 2006)

Equitable Revisited. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (ESA, 2007)

Approximation for Batching via Priorities. - Wolfgang W. Bein; John Noga; Jeff Wiegley (Sci. Ann. Comput. Sci., 2007)

Uniform metrical task systems with a limited number of states. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga (Inf. Process. Lett., 2007)

Priority Approximation for Batching. - Wolfgang W. Bein; John Noga; Jeff Wiegley (HICSS, 2008)

Incremental Medians via Online Bidding. - Marek Chrobak; Claire Kenyon; John Noga; Neal E. Young (Algorithmica, 2008)

A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (CoRR, 2009)

Optimally competitive list batching. - Wolfgang W. Bein; Leah Epstein; Lawrence L. Larmore; John Noga (Theor. Comput. Sci., 2009)

Knowledge State Algorithms. - Wolfgang W. Bein; Lawrence L. Larmore; John Noga; Rüdiger Reischuk (Algorithmica, 2011)