John Noga - RankMe

40 papers A* 5A 4B 4Journal 20Unranked 7

Year	Rank	Type	Title / Venue / Authors
2011	J	`jnl`	Knowledge State Algorithms. Algorithmica Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk
2009	J	`jnl`	A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs CoRR Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2009	J	`jnl`	Optimally competitive list batching. Theor. Comput. Sci. Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2008	J	`jnl`	Incremental Medians via Online Bidding. Algorithmica Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2008	—	`conf`	Priority Approximation for Batching. HICSS Wolfgang W. Bein, John Noga, Jeff Wiegley
2007	J	`jnl`	Approximation for Batching via Priorities. Sci. Ann. Comput. Sci. Wolfgang W. Bein, John Noga, Jeff Wiegley
2007	A	`conf`	Equitable Revisited. ESA Wolfgang W. Bein, Lawrence L. Larmore, John Noga
2007	J	`jnl`	Uniform metrical task systems with a limited number of states. Inf. Process. Lett. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
2006	B	`conf`	Oblivious Medians Via Online Bidding. LATIN Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2005	—	`conf`	A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN Wolfgang W. Bein, Lawrence L. Larmore, John Noga
2005	B	`conf`	A Note on Semi-online Machine Covering. WAOA Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger
2005	—	`conf`	An Online Partially Fractional Knapsack Problem. ISPAN John Noga, Veerawan Sarbua
2005	A	`conf`	Experiments with balanced-sample binary trees. SIGCSE G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley
2005	J	`jnl`	Oblivious Medians via Online Bidding CoRR Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
2005	J	`jnl`	Random Walks with Anti-Correlated Steps CoRR Dirk Wagner, John Noga
2005	B	`conf`	The Delayed FCT Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
2004	—	`conf`	Optimally Competitive List Batching. SWAT Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
2003	J	`jnl`	Dynamic TCP acknowledgment in the LogP model. J. Algorithms Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut
2003	J	`jnl`	More on randomized on-line algorithms for caching. Theor. Comput. Sci. Marek Chrobak, Elias Koutsoupias, John Noga
2003	J	`jnl`	Preemptive scheduling in overloaded systems. J. Comput. Syst. Sci. Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2002	J	`jnl`	A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. John Noga, Steven Seiden, Gerhard J. Woeginger
2002	J	`jnl`	Caching for Web Searching. Algorithmica Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
2002	J	`jnl`	More on random walks, electrical networks, and the harmonic k-server algorithm. Inf. Process. Lett. Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan
2002	J	`jnl`	On-line scheduling of unit time jobs with rejection: minimizing the total completion time. Oper. Res. Lett. Leah Epstein, John Noga, Gerhard J. Woeginger
2002	A*	`conf`	Preemptive Scheduling in Overloaded Systems. ICALP Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
2002	J	`jnl`	Solution of a problem in DNA computing. Theor. Comput. Sci. Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger
2001	J	`jnl`	An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. John Noga, Steven S. Seiden
2001	A	`conf`	Buying a Constant Competitive Ratio for Paging. ESA János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
2001	A*	`conf`	The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. ICALP Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jirí Sgall, Gerhard J. Woeginger
2000	—	`conf`	Caching for Web Searching. SWAT Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
2000	J	`jnl`	Competitive Algorithms for Relaxed List Update and Multilevel Caching. J. Algorithms Marek Chrobak, John Noga
2000	J	`jnl`	Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. Dimitris Achlioptas, Marek Chrobak, John Noga
1999	J	`jnl`	LRU Is Better than FIFO. Algorithmica Marek Chrobak, John Noga
1999	A*	`conf`	Randomized Online Scheduling on Two Uniform Machines. SODA Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger
1999	B	`conf`	Scheduling Two Machines with Release Times. IPCO John Noga, Steven S. Seiden
1999	—	`conf`	Scheduling with Machine Cost. RANDOM-APPROX Csanád Imreh, John Noga
1998	A*	`conf`	Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). SODA Marek Chrobak, John Noga
1998	A*	`conf`	LRU is Better than FIFO. SODA Marek Chrobak, John Noga
1996	—	`conf`	Bibliography on Competitive Algorithms. Online Algorithms Marek Chrobak, John Noga
1996	A	`conf`	Competive Analysis of Randomized Paging Algorithms. ESA Dimitris Achlioptas, Marek Chrobak, John Noga