default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Noga
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j17]Wolfgang W. Bein, Lawrence L. Larmore, John Noga, Rüdiger Reischuk:
Knowledge State Algorithms. Algorithmica 60(3): 653-678 (2011)
2000 – 2009
- 2009
- [j16]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally competitive list batching. Theor. Comput. Sci. 410(38-40): 3631-3639 (2009) - [i3]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 abs/0904.1002 (2009) - 2008
- [j15]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
:
Incremental Medians via Online Bidding. Algorithmica 50(4): 455-478 (2008) - [c20]Wolfgang W. Bein, John Noga, Jeff Wiegley:
Priority Approximation for Batching. HICSS 2008: 477 - 2007
- [j14]Wolfgang W. Bein, John Noga, Jeff Wiegley:
Approximation for Batching via Priorities. Sci. Ann. Comput. Sci. 17: 1-18 (2007) - [j13]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
Uniform metrical task systems with a limited number of states. Inf. Process. Lett. 104(4): 123-128 (2007) - [c19]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
Equitable Revisited. ESA 2007: 419-426 - 2006
- [c18]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Oblivious Medians Via Online Bidding. LATIN 2006: 311-322 - 2005
- [c17]Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga:
The Delayed k-Server Problem. FCT 2005: 281-292 - [c16]Wolfgang W. Bein, Lawrence L. Larmore, John Noga:
A Better Algorithm for Uniform Metrical Task Systems with Few States. ISPAN 2005: 94-99 - [c15]John Noga, Veerawan Sarbua:
An Online Partially Fractional Knapsack Problem. ISPAN 2005: 108-112 - [c14]G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley:
Experiments with balanced-sample binary trees. SIGCSE 2005: 166-170 - [c13]Tomás Ebenlendr, John Noga, Jirí Sgall, Gerhard J. Woeginger:
A Note on Semi-online Machine Covering. WAOA 2005: 110-118 - [i2]Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young:
Oblivious Medians via Online Bidding. CoRR abs/cs/0504103 (2005) - [i1]Dirk Wagner, John Noga:
Random Walks with Anti-Correlated Steps. CoRR abs/cs/0512043 (2005) - 2004
- [c12]Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga:
Optimally Competitive List Batching. SWAT 2004: 77-89 - 2003
- [j12]Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut:
Dynamic TCP acknowledgment in the LogP model. J. Algorithms 48(2): 407-428 (2003) - [j11]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): 183-197 (2003) - [j10]Marek Chrobak, Elias Koutsoupias, John Noga:
More on randomized on-line algorithms for caching. Theor. Comput. Sci. 290(3): 1997-2008 (2003) - 2002
- [j9]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. Algorithmica 33(3): 353-370 (2002) - [j8]John Noga, Steven S. Seiden, Gerhard J. Woeginger:
A faster off-line algorithm for the TCP acknowledgement problem. Inf. Process. Lett. 81(2): 71-73 (2002) - [j7]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): 271-276 (2002) - [j6]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): 415-420 (2002) - [j5]Eric Anderson, Marek Chrobak, John Noga, Jirí Sgall, Gerhard J. Woeginger:
Solution of a problem in DNA computing. Theor. Comput. Sci. 287(2): 387-391 (2002) - [c11]Marek Chrobak, Leah Epstein, John Noga, Jirí Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania:
Preemptive Scheduling in Overloaded Systems. ICALP 2002: 800-811 - 2001
- [j4]John Noga, Steven S. Seiden:
An optimal online algorithm for scheduling two machines with release times. Theor. Comput. Sci. 268(1): 133-143 (2001) - [c10]János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger:
Buying a Constant Competitive Ratio for Paging. ESA 2001: 98-108 - [c9]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: 862-874 - 2000
- [j3]Marek Chrobak, John Noga:
Competitive Algorithms for Relaxed List Update and Multilevel Caching. J. Algorithms 34(2): 282-308 (2000) - [j2]Dimitris Achlioptas, Marek Chrobak, John Noga:
Competitive analysis of randomized paging algorithms. Theor. Comput. Sci. 234(1-2): 203-218 (2000) - [c8]Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger:
Caching for Web Searching. SWAT 2000: 150-163
1990 – 1999
- 1999
- [j1]Marek Chrobak, John Noga:
LRU Is Better than FIFO. Algorithmica 23(2): 180-185 (1999) - [c7]John Noga, Steven S. Seiden:
Scheduling Two Machines with Release Times. IPCO 1999: 391-399 - [c6]Csanád Imreh, John Noga:
Scheduling with Machine Cost. RANDOM-APPROX 1999: 168-176 - [c5]Leah Epstein, John Noga, Steven S. Seiden, Jirí Sgall, Gerhard J. Woeginger:
Randomized Online Scheduling on Two Uniform Machines. SODA 1999: 317-326 - 1998
- [c4]Marek Chrobak, John Noga:
LRU is Better than FIFO. SODA 1998: 78-81 - [c3]Marek Chrobak, John Noga:
Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). SODA 1998: 87-96 - 1996
- [c2]Marek Chrobak, John Noga:
Bibliography on Competitive Algorithms. Online Algorithms 1996: 395-436 - [c1]Dimitris Achlioptas, Marek Chrobak, John Noga:
Competive Analysis of Randomized Paging Algorithms. ESA 1996: 419-430
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
