The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
John Noga: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Marek Chrobak, John Noga
    Bibliography on Competitive Algorithms. [Citation Graph (0, 0)][DBLP]
    Online Algorithms, 1996, pp:395-436 [Conf]
  2. Dimitris Achlioptas, Marek Chrobak, John Noga
    Competive Analysis of Randomized Paging Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1996, pp:419-430 [Conf]
  3. János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger
    Buying a Constant Competitive Ratio for Paging. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:98-108 [Conf]
  4. Wolfgang W. Bein, Kazuo Iwama, Lawrence L. Larmore, John Noga
    The Delayed k-Server Problem. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:281-292 [Conf]
  5. Marek Chrobak, János Csirik, Csanád Imreh, John Noga, Jiri Sgall, Gerhard J. Woeginger
    The Buffer Minimization Problem for Multiprocessor Scheduling with Conflicts. [Citation Graph (0, 0)][DBLP]
    ICALP, 2001, pp:862-874 [Conf]
  6. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive Scheduling in Overloaded Systems. [Citation Graph (0, 0)][DBLP]
    ICALP, 2002, pp:800-811 [Conf]
  7. John Noga, Steven S. Seiden
    Scheduling Two Machines with Release Times. [Citation Graph (0, 0)][DBLP]
    IPCO, 1999, pp:391-399 [Conf]
  8. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians Via Online Bidding. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:311-322 [Conf]
  9. Csanád Imreh, John Noga
    Scheduling with Machine Cost. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 1999, pp:168-176 [Conf]
  10. G. Michael Barnes, John Noga, Peter D. Smith, Jeff Wiegley
    Experiments with balanced-sample binary trees. [Citation Graph (0, 0)][DBLP]
    SIGCSE, 2005, pp:166-170 [Conf]
  11. Marek Chrobak, John Noga
    LRU is Better than FIFO. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:78-81 [Conf]
  12. Marek Chrobak, John Noga
    Competive Algorithms for Multilevel Caching and Relaxed List Update (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:87-96 [Conf]
  13. Leah Epstein, John Noga, Steven S. Seiden, Jiri Sgall, Gerhard J. Woeginger
    Randomized Online Scheduling on Two Uniform Machines. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:317-326 [Conf]
  14. Wolfgang W. Bein, Leah Epstein, Lawrence L. Larmore, John Noga
    Optimally Competitive List Batching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2004, pp:77-89 [Conf]
  15. Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
    Caching for Web Searching. [Citation Graph (0, 0)][DBLP]
    SWAT, 2000, pp:150-163 [Conf]
  16. Tomás Ebenlendr, John Noga, Jiri Sgall, Gerhard J. Woeginger
    A Note on Semi-online Machine Covering. [Citation Graph (0, 0)][DBLP]
    WAOA, 2005, pp:110-118 [Conf]
  17. Marek Chrobak, John Noga
    LRU Is Better than FIFO. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:23, n:2, pp:180-185 [Journal]
  18. Bala Kalyanasundaram, John Noga, Kirk Pruhs, Gerhard J. Woeginger
    Caching for Web Searching. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:33, n:3, pp:353-370 [Journal]
  19. Yair Bartal, Marek Chrobak, John Noga, Prabhakar Raghavan
    More on random walks, electrical networks, and the harmonic k-server algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:84, n:5, pp:271-276 [Journal]
  20. John Noga, Steven S. Seiden, Gerhard J. Woeginger
    A faster off-line algorithm for the TCP acknowledgement problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:81, n:2, pp:71-73 [Journal]
  21. Marek Chrobak, John Noga
    Competitive Algorithms for Relaxed List Update and Multilevel Caching. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2000, v:34, n:2, pp:282-308 [Journal]
  22. Jens S. Frederiksen, Kim S. Larsen, John Noga, Patchrawat Uthaisombut
    Dynamic TCP acknowledgment in the LogP model. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2003, v:48, n:2, pp:407-428 [Journal]
  23. Marek Chrobak, Leah Epstein, John Noga, Jiri Sgall, Rob van Stee, Tomás Tichý, Nodari Vakhania
    Preemptive scheduling in overloaded systems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2003, v:67, n:1, pp:183-197 [Journal]
  24. Leah Epstein, John Noga, Gerhard J. Woeginger
    On-line scheduling of unit time jobs with rejection: minimizing the total completion time. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2002, v:30, n:6, pp:415-420 [Journal]
  25. Dimitris Achlioptas, Marek Chrobak, John Noga
    Competitive analysis of randomized paging algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:234, n:1-2, pp:203-218 [Journal]
  26. Eric Anderson, Marek Chrobak, John Noga, Jiri Sgall, Gerhard J. Woeginger
    Solution of a problem in DNA computing. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:287, n:2, pp:387-391 [Journal]
  27. Marek Chrobak, Elias Koutsoupias, John Noga
    More on randomized on-line algorithms for caching. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1997-2008 [Journal]
  28. John Noga, Steven S. Seiden
    An optimal online algorithm for scheduling two machines with release times. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:133-143 [Journal]
  29. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
    Equitable Revisited. [Citation Graph (0, 0)][DBLP]
    ESA, 2007, pp:419-426 [Conf]
  30. Marek Chrobak, Claire Kenyon, John Noga, Neal E. Young
    Oblivious Medians via Online Bidding [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  31. Wolfgang W. Bein, Lawrence L. Larmore, John Noga
    Uniform metrical task systems with a limited number of states. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:104, n:4, pp:123-128 [Journal]

  32. Priority Approximation for Batching. [Citation Graph (, )][DBLP]


  33. An Online Partially Fractional Knapsack Problem. [Citation Graph (, )][DBLP]


  34. A Better Algorithm for Uniform Metrical Task Systems with Few States. [Citation Graph (, )][DBLP]


  35. Incremental Medians via Online Bidding. [Citation Graph (, )][DBLP]


  36. Random Walks with Anti-Correlated Steps [Citation Graph (, )][DBLP]


  37. A Program to Determine the Exact Competitive Ratio of List s-Batching with Unit Jobs [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.008secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002