John Noga

According to our database, John Noga authored at least 35 papers between 1996 and 2011.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2011

Knowledge State Algorithms.

Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk

Algorithmica, 2011

2009

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

2008

Incremental Medians via Online Bidding.

Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young

Algorithmica, 2008

Priority Approximation for Batching.

Wolfgang W. Bein, John Noga, Jeff Wiegley

Proceedings of the 41st Hawaii International International Conference on Systems Science (HICSS-41 2008), 2008

2007

Uniform metrical task systems with a limited number of states.

Wolfgang W. Bein, Lawrence L. Larmore, John Noga

Inf. Process. Lett., 2007

Approximation for Batching via Priorities.

Wolfgang W. Bein, John Noga, Jeff Wiegley

Sci. Ann. Comput. Sci., 2007

Equitable Revisited.

Wolfgang W. Bein, Lawrence L. Larmore, John Noga

Proceedings of the Algorithms, 2007

2006

Oblivious Medians Via Online Bidding.

Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young

Proceedings of the LATIN 2006: Theoretical Informatics, 2006

2005

Random Walks with Anti-Correlated Steps

Dirk Wagner, John Noga

CoRR, 2005

A Note on Semi-online Machine Covering.

Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger

Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Experiments with balanced-sample binary trees.

G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley

Proceedings of the 36th SIGCSE Technical Symposium on Computer Science Education, 2005

An Online Partially Fractional Knapsack Problem.

John Noga, Veerawan Sarbua

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

A Better Algorithm for Uniform Metrical Task Systems with Few States.

Wolfgang W. Bein, Lawrence L. Larmore, John Noga

Proceedings of the 8th International Symposium on Parallel Architectures, 2005

The Delayed <i>k</i>-Server Problem.

Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Optimally Competitive List Batching.

Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga

Proceedings of the Algorithm Theory, 2004

2003

More on randomized on-line algorithms for caching.

Marek Chrobak, Elias Koutsoupias, John Noga

Theor. Comput. Sci., 2003

Dynamic TCP acknowledgment in the LogP model.

Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut

J. Algorithms, 2003

2002

Solution of a problem in DNA computing.

Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger

Theor. Comput. Sci., 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

A faster off-line algorithm for the TCP acknowledgement problem.

John Noga, Steven Seiden, Gerhard J. Woeginger

Inf. Process. Lett., 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

Preemptive Scheduling in Overloaded Systems.

Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania

Proceedings of the Automata, Languages and Programming, 29th International Colloquium, 2002

2001

An optimal online algorithm for scheduling two machines with release times.

John Noga, Steven S. Seiden

Theor. Comput. Sci., 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

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Buying a Constant Competitive Ratio for Paging.

János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger

Proceedings of the Algorithms, 2001

2000

Competitive analysis of randomized paging algorithms.

Dimitris Achlioptas, Marek Chrobak, John Noga

Theor. Comput. Sci., 2000

Competitive Algorithms for Relaxed List Update and Multilevel Caching.

Marek Chrobak, John Noga

J. Algorithms, 2000

Caching for Web Searching.

Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger

Proceedings of the Algorithm Theory, 2000

1999

Randomized Online Scheduling on Two Uniform Machines.

Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Scheduling with Machine Cost.

Csanád Imreh, John Noga

Proceedings of the Randomization, 1999

Scheduling Two Machines with Release Times.

John Noga, Steven S. Seiden

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

1998

Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract).

Marek Chrobak, John Noga

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

LRU is Better than FIFO.

Marek Chrobak, John Noga

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1996

Competive Analysis of Randomized Paging Algorithms.

Dimitris Achlioptas, Marek Chrobak, John Noga

Proceedings of the Algorithms, 1996

Bibliography on Competitive Algorithms.

Marek Chrobak, John Noga

Proceedings of the Online Algorithms, 1996