John Noga

Publication Activity (10 Years)

Years Active: 1996-2011
Publications (10 Years): 0

Publications

Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk
Knowledge State Algorithms. Algorithmica 60 (3) (2011)
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 (2009)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
Optimally competitive list batching. Theor. Comput. Sci. 410 (38-40) (2009)
Wolfgang W. Bein, John Noga, Jeff Wiegley
Priority Approximation for Batching. HICSS (2008)
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
Incremental Medians via Online Bidding. Algorithmica 50 (4) (2008)
Wolfgang W. Bein, John Noga, Jeff Wiegley
Approximation for Batching via Priorities. Sci. Ann. Comput. Sci. 17 (2007)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104 (4) (2007)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
Equitable Revisited. ESA (2007)
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
Oblivious Medians Via Online Bidding. LATIN (2006)
Dirk Wagner, John Noga
Random Walks with Anti-Correlated Steps CoRR (2005)
Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
Oblivious Medians via Online Bidding CoRR (2005)
John Noga, Veerawan Sarbua
An Online Partially Fractional Knapsack Problem. ISPAN (2005)
Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
A Note on Semi-online Machine Covering. WAOA (2005)
G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley
Experiments with balanced-sample binary trees. SIGCSE (2005)
Wolfgang W. Bein, Lawrence L. Larmore, John Noga
A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN (2005)
Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
-Server Problem. FCT (2005)
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
Optimally Competitive List Batching. SWAT (2004)
Marek Chrobak, Elias Koutsoupias, John Noga
More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290 (3) (2003)
Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut
Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48 (2) (2003)
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. 67 (1) (2003)
Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
Caching for Web Searching. Algorithmica 33 (3) (2002)
John Noga, Steven S. Seiden, Gerhard J. Woeginger
A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. 81 (2) (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) (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) (2002)
Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger
Solution of a problem in DNA computing. Theor. Comput. Sci. 287 (2) (2002)
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
Preemptive Scheduling in Overloaded Systems. ICALP (2002)
Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger
The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP (2001)
John Noga, Steven S. Seiden
An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. 268 (1) (2001)
János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
Buying a Constant Competitive Ratio for Paging. ESA (2001)
Marek Chrobak, John Noga
Competitive Algorithms for Relaxed List Update and Multilevel Caching. J. Algorithms 34 (2) (2000)
Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
Caching for Web Searching. SWAT (2000)
Dimitris Achlioptas, Marek Chrobak, John Noga
Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234 (1-2) (2000)
Marek Chrobak, John Noga
LRU Is Better than FIFO. Algorithmica 23 (2) (1999)
John Noga, Steven S. Seiden
Scheduling Two Machines with Release Times. IPCO (1999)
Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger
Randomized Online Scheduling on Two Uniform Machines. SODA (1999)
Csanád Imreh, John Noga
Scheduling with Machine Cost. RANDOM-APPROX (1999)
Marek Chrobak, John Noga
LRU is Better than FIFO. SODA (1998)
Marek Chrobak, John Noga
Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). SODA (1998)
Marek Chrobak, John Noga
Bibliography on Competitive Algorithms. Online Algorithms (1996)
Dimitris Achlioptas, Marek Chrobak, John Noga
Competive Analysis of Randomized Paging Algorithms. ESA (1996)