| Publication | Date of Publication | Type |
|---|
Competitive analysis of randomized paging algorithms
Algorithms — ESA '96 | 2017-12-05 | Paper |
Approximation for batching via priorities
| 2016-08-05 | Paper |
Knowledge state algorithms
Algorithmica | 2011-06-30 | Paper |
Uniform metrical task systems with a limited number of states
Information Processing Letters | 2010-03-24 | Paper |
Optimally competitive list batching
Theoretical Computer Science | 2009-09-10 | Paper |
Equitable Revisited
Algorithms – ESA 2007 | 2008-09-25 | Paper |
Oblivious Medians Via Online Bidding
LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
Incremental medians via online bidding
Algorithmica | 2008-04-23 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
scientific article; zbMATH DE number 2086672 (Why is no real title available?)
| 2004-08-11 | Paper |
Dynamic TCP acknowledgment in the LogP model
Journal of Algorithms | 2004-03-14 | Paper |
Preemptive scheduling in overloaded systems.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
More on randomized on-line algorithms for caching.
Theoretical Computer Science | 2003-08-17 | Paper |
On-line scheduling of unit time jobs with rejection: Minimizing the total completion time
Operations Research Letters | 2003-05-04 | Paper |
scientific article; zbMATH DE number 1875410 (Why is no real title available?)
| 2003-03-02 | Paper |
More on random walks, electrical networks, and the harmonic \(k\)-server algorithm.
Information Processing Letters | 2003-01-21 | Paper |
A faster off-line algorithm for the TCP acknowledgement problem.
Information Processing Letters | 2002-07-14 | Paper |
Caching for web searching
Algorithmica | 2002-06-17 | Paper |
scientific article; zbMATH DE number 1754640 (Why is no real title available?)
| 2002-06-12 | Paper |
An optimal online algorithm for scheduling two machines with release times
Theoretical Computer Science | 2002-03-03 | Paper |
Randomized on-line scheduling on two uniform machines
Journal of Scheduling | 2001-07-12 | Paper |
scientific article; zbMATH DE number 1617255 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1305421 (Why is no real title available?)
| 2000-09-26 | Paper |
Competitive Algorithms for Relaxed List Update and Multilevel Caching
Journal of Algorithms | 2000-08-28 | Paper |
Competitive analysis of randomized paging algorithms
Theoretical Computer Science | 2000-08-21 | Paper |
scientific article; zbMATH DE number 1303545 (Why is no real title available?)
| 2000-05-25 | Paper |
scientific article; zbMATH DE number 1418274 (Why is no real title available?)
| 2000-03-19 | Paper |
scientific article; zbMATH DE number 1342144 (Why is no real title available?)
| 1999-09-22 | Paper |
LRU is better than FIFO
Algorithmica | 1999-08-17 | Paper |
scientific article; zbMATH DE number 1303543 (Why is no real title available?)
| 1999-06-17 | Paper |
