Demo Data from EDBT 2026 / reviewers in the wild / expert
John Noga
dblp:29/6413
· DBLP profile ↗
26ranked-venue papers
3as first author
0since 2021 · last 2011
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 25 · 3 first-authorDatabases, data management, data science and information retrieval · 3 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
5 papers |
Mathematical optimization · 48% Approximation and online algorithms · 43% Algorithms and data structures · 9% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Approximation and online algorithms
online algorithms |
0.1 | 3 | 2002 | Preemptive Scheduling in Overloaded Systems · ICALP 2002 Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract) · SODA 1998 LRU is Better than FIFO · SODA 1998 |
Mathematical optimization
scheduling |
0.1 | 2 | 2002 | Preemptive Scheduling in Overloaded Systems · ICALP 2002 The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts · ICALP 2001 |
Mathematical optimization › scheduling › job scheduling
preemptive scheduling |
0.0 | 1 | 2002 | Preemptive Scheduling in Overloaded Systems · ICALP 2002 |
Mathematical optimization › scheduling
multiprocessor scheduling |
0.0 | 1 | 2001 | The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts · ICALP 2001 |
Approximation and online algorithms › online algorithms
online scheduling |
0.0 | 1 | 1999 | Randomized Online Scheduling on Two Uniform Machines · SODA 1999 |
Mathematical optimization › scheduling › parallel machine scheduling
related machines |
0.0 | 1 | 1999 | Randomized Online Scheduling on Two Uniform Machines · SODA 1999 |
Approximation and online algorithms › online algorithms
caching |
0.0 | 1 | 1998 | LRU is Better than FIFO · SODA 1998 |
Approximation and online algorithms › online algorithms
list update |
0.0 | 1 | 1998 | Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract) · SODA 1998 |
Methods — techniques the papers use, named apart from their topics
competitive analysis · 0.0randomized online algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Knowledge State Algorithms
Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk |
Algorithmica | 3 |
| 2009 | Optimally competitive list batching
Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga |
Theor. Comput. Sci. | 4 |
| 2008 | Incremental Medians via Online Bidding
Marek Chrobak, Claire Mathieu, John Noga, Neal E. Young |
Algorithmica | 3 |
| 2007 | Equitable Revisited
Wolfgang W. Bein, Lawrence L. Larmore, John Noga |
ESA | 3 |
| 2007 | Uniform metrical task systems with a limited number of states
Wolfgang W. Bein, Lawrence L. Larmore, John Noga |
Inf. Process. Lett. | 3 |
| 2006 | Oblivious Medians Via Online Bidding
Marek Chrobak, Claire Mathieu, John Noga, Neal E. Young |
LATIN | 3 |
| 2005 | The Delayed k-Server Problem
Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga |
FCT | 4 |
| 2005 | Experiments with balanced-sample binary treesabstractIn this paper we propose using experiments with Balanced-Sample Binary Trees (BSBTrees) as assignments and lecture material in intermediate data structures courses (CS2/3). BSBTrees are composite data structures that have a temporarily constructed form that precedes their normal construction. We present them in the context of binary search trees. To do this we first investigate the retrieval properties of randomly generated binary search trees and show how temporary construction can improve both worst case and average case behavior. We provide a brief analysis of BSBTree performance and description of the classes that can be used for BSBTree implementation. Last we discuss the use of BSBTrees in CS2 and CS3 courses and a survey of student opinions about BSBTrees. G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley |
SIGCSE | 2 |
| 2005 | A Note on Semi-online Machine Covering
Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger |
WAOA | 2 |
| 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. | 3 |
| 2003 | More on randomized on-line algorithms for caching
Marek Chrobak, Elias Koutsoupias, John Noga |
Theor. Comput. Sci. | 3 |
| 2002 | Preemptive Scheduling in Overloaded Systems
Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania |
ICALP | 3 |
| 2002 | Caching for Web Searching
Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger |
Algorithmica | 2 |
| 2002 | More on random walks, electrical networks, and the harmonic k-server algorithm
Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan |
Inf. Process. Lett. | 3 |
| 2002 | A faster off-line algorithm for the TCP acknowledgement problem
John Noga, Steven S. Seiden, Gerhard J. Woeginger |
Inf. Process. Lett. | 1 |
| 2002 | Solution of a problem in DNA computing
Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger |
Theor. Comput. Sci. | 3 |
| 2001 | Buying a Constant Competitive Ratio for Paging
János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger |
ESA | 3 |
| 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 | 4 |
| 2001 | An optimal online algorithm for scheduling two machines with release times
John Noga, Steven S. Seiden |
Theor. Comput. Sci. | 1 |
| 2000 | Competitive analysis of randomized paging algorithms
Dimitris Achlioptas, Marek Chrobak, John Noga |
Theor. Comput. Sci. | 3 |
| 1999 | Scheduling Two Machines with Release Times
John Noga, Steven S. Seiden |
IPCO | 1 |
| 1999 | Randomized Online Scheduling on Two Uniform Machines
Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger |
SODA | 2 |
| 1999 | LRU Is Better than FIFO
Marek Chrobak, John Noga |
Algorithmica | 2 |
| 1998 | LRU is Better than FIFO
Marek Chrobak, John Noga |
SODA | 2 |
| 1998 | Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract)
Marek Chrobak, John Noga |
SODA | 2 |
| 1996 | Competive Analysis of Randomized Paging Algorithms
Dimitris Achlioptas, Marek Chrobak, John Noga |
ESA | 3 |