| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7799584 (Why is no real title available?) | 2024-02-05 | Paper |
| scientific article; zbMATH DE number 7788625 (Why is no real title available?) | 2024-01-15 | Paper |
| Optimal Algorithms for Online b-Matching with Variable Vertex Capacities | 2023-11-20 | Paper |
Online ad allocation in bounded-degree graphs
Web and Internet Economics | 2023-08-04 | Paper |
Machine covering in the random-order model
Algorithmica | 2023-06-05 | Paper |
Algorithms for energy conservation in heterogeneous data centers
Lecture Notes in Computer Science | 2023-03-22 | Paper |
| New Bounds for Randomized List Update in the Paid Exchange Model. | 2023-02-07 | Paper |
| scientific article; zbMATH DE number 7650251 (Why is no real title available?) | 2023-02-03 | Paper |
| Improved Online Algorithms for Knapsack and GAP in the Random Order Model | 2023-02-03 | Paper |
Page migration with limited local memory capacity
Lecture Notes in Computer Science | 2022-12-16 | Paper |
New on-line algorithms for the page replication problem
Algorithm Theory — SWAT '94 | 2022-12-09 | Paper |
A competitive analysis of the list update problem with lookahead
Mathematical Foundations of Computer Science 1994 | 2022-08-18 | Paper |
| Best fit bin packing with random order revisited | 2022-07-18 | Paper |
| Scheduling with testing on multiple identical parallel machines | 2022-03-25 | Paper |
| Online makespan minimization with budgeted uncertainty | 2022-03-25 | Paper |
| Explorable uncertainty in scheduling with non-uniform testing times | 2022-03-22 | Paper |
Algorithms for energy conservation in heterogeneous data centers
Theoretical Computer Science | 2021-11-18 | Paper |
Scheduling In the random-order model
Algorithmica | 2021-09-02 | Paper |
Best fit bin packing with random order revisited
Algorithmica | 2021-09-02 | Paper |
Improved online algorithms for knapsack and GAP in the random order model
Algorithmica | 2021-06-11 | Paper |
New results for the \(k\)-secretary problem
Theoretical Computer Science | 2021-03-18 | Paper |
Tight bounds for online coloring of basic graph classes
Algorithmica | 2021-02-01 | Paper |
| Tight bounds for online coloring of basic graph classes | 2020-05-27 | Paper |
| On the Value of Penalties in Time-Inconsistent Planning | 2020-05-27 | Paper |
Motivating time-inconsistent agents: a computational approach
Theory of Computing Systems | 2019-06-27 | Paper |
| Race to idle: new algorithms for speed scaling with a sleep state | 2019-05-10 | Paper |
The price of uncertainty in present-biased planning
Web and Internet Economics | 2019-01-30 | Paper |
New online algorithms for story scheduling in web advertising
Algorithmica | 2019-01-11 | Paper |
Energy-efficient algorithms for flow time minimization
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| scientific article; zbMATH DE number 6971073 (Why is no real title available?) | 2018-11-02 | Paper |
Quantifying competitiveness in paging with locality of reference
Algorithmica | 2018-10-18 | Paper |
Scheduling on power-heterogeneous processors
Information and Computation | 2017-11-16 | Paper |
On the value of job migration in online makespan minimization
Algorithmica | 2017-10-10 | Paper |
Online makespan minimization with parallel schedules
Algorithmica | 2017-07-07 | Paper |
Motivating Time-Inconsistent Agents: A Computational Approach
Web and Internet Economics | 2017-02-10 | Paper |
Revisiting the COUNTER algorithms for list update
Information Processing Letters | 2016-05-26 | Paper |
On approximate Nash equilibria in network design
Internet Mathematics | 2016-05-25 | Paper |
Scheduling on power-heterogeneous processors
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
On list update with locality of reference
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Quantifying competitiveness in paging with locality of reference
Automata, Languages, and Programming | 2015-10-27 | Paper |
Race to idle: new algorithms for speed scaling with a sleep state
ACM Transactions on Algorithms | 2015-08-14 | Paper |
On multi-processor speed scaling with migration
Journal of Computer and System Sciences | 2015-07-13 | Paper |
Speed scaling on parallel processors
Algorithmica | 2014-12-02 | Paper |
Online makespan minimization with parallel schedules
Lecture Notes in Computer Science | 2014-09-02 | Paper |
Recent advances for a classical scheduling problem
Automata, Languages, and Programming | 2013-08-07 | Paper |
New online algorithms for story scheduling in web advertising
Automata, Languages, and Programming | 2013-08-07 | Paper |
Online Algorithms
Interactive Computation | 2013-06-18 | Paper |
Ronald Graham: laying the foundations of online optimization
Documenta Mathematica | 2013-04-17 | Paper |
On the value of job migration in online makespan minimization
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Semi-online scheduling revisited
Theoretical Computer Science | 2012-08-10 | Paper |
| Algorithms for dynamic speed scaling | 2012-01-23 | Paper |
New results on web caching with request reordering
Algorithmica | 2010-09-16 | Paper |
On nash equilibria for a network creation game
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
On the performance of greedy algorithms in packet buffering
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
| scientific article; zbMATH DE number 5764884 (Why is no real title available?) | 2010-08-06 | Paper |
On randomized online scheduling
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
On paging with locality of reference
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Algorithms for energy management (invited talk)
Computer Science – Theory and Applications | 2010-06-22 | Paper |
An experimental study of new and known online packet buffering algorithms
Algorithmica | 2010-05-28 | Paper |
Integrated prefetching and caching with read and write requests.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
On the value of coordination in network design
SIAM Journal on Computing | 2010-01-06 | Paper |
Resource Management in Large Networks
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
An Experimental Study of New and Known Online Packet Buffering Algorithms
Algorithms – ESA 2007 | 2008-09-25 | Paper |
On List Update with Locality of Reference
Automata, Languages and Programming | 2008-08-28 | Paper |
Energy-Efficient Algorithms for Flow Time Minimization
STACS 2006 | 2008-03-19 | Paper |
A study of integrated document and connection caching in the WWW
Algorithmica | 2007-04-26 | Paper |
Minimizing stall time in single and parallel disk systems
Journal of the ACM | 2006-09-12 | Paper |
On the Performance of Greedy Algorithms in Packet Buffering
SIAM Journal on Computing | 2006-06-01 | Paper |
Dynamic TCP Acknowledgment: Penalizing Long Delays
SIAM Journal on Discrete Mathematics | 2006-06-01 | Paper |
An experimental study of online scheduling algorithms
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
On paging with locality of reference
Journal of Computer and System Sciences | 2005-05-12 | Paper |
Integrated prefetching and caching in single and parallel disk systems
Information and Computation | 2005-05-04 | Paper |
| scientific article; zbMATH DE number 2102774 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2079320 (Why is no real title available?) | 2004-07-28 | Paper |
| scientific article; zbMATH DE number 2038745 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 1775431 (Why is no real title available?) | 2004-01-27 | Paper |
Online algorithms: a survey
Mathematical Programming. Series A. Series B | 2003-09-01 | Paper |
| scientific article; zbMATH DE number 1875405 (Why is no real title available?) | 2003-03-02 | Paper |
| scientific article; zbMATH DE number 1848286 (Why is no real title available?) | 2003-02-04 | Paper |
Delayed information and action in on-line algorithms
Information and Computation | 2003-01-14 | Paper |
On generalized connection caching
Theory of Computing Systems | 2002-12-01 | Paper |
Scheduling with unexpected machine breakdowns
Discrete Applied Mathematics | 2002-10-31 | Paper |
Randomized splay trees: Theoretical and experimental results.
Information Processing Letters | 2002-07-14 | Paper |
Exploring unknown environments with obstacles
Algorithmica | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1559597 (Why is no real title available?) | 2001-03-01 | Paper |
| scientific article; zbMATH DE number 1559557 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1303568 (Why is no real title available?) | 2000-10-17 | Paper |
| Average-case analyses of first fit and random fit bin packing | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1305389 (Why is no real title available?) | 2000-04-13 | Paper |
Exploring Unknown Environments
SIAM Journal on Computing | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1418278 (Why is no real title available?) | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1305480 (Why is no real title available?) | 2000-02-22 | Paper |
| scientific article; zbMATH DE number 1398093 (Why is no real title available?) | 2000-02-03 | Paper |
Better Bounds for Online Scheduling
SIAM Journal on Computing | 1999-10-28 | Paper |
Average case analyses of list update algorithms, with applications to data compression
Algorithmica | 1998-11-18 | Paper |
New On-Line Algorithms for the Page Replication Problem
Journal of Algorithms | 1998-10-06 | Paper |
A competitive analysis of the list update problem with lookahead
Theoretical Computer Science | 1998-08-13 | Paper |
Improved Randomized On-Line Algorithms for the List Update Problem
SIAM Journal on Computing | 1998-05-10 | Paper |
On the influence of lookahead in competitive paging algorithms
Algorithmica | 1997-12-17 | Paper |
Improved parallel integer sorting without concurrent writing
Information and Computation | 1997-11-10 | Paper |
A combined BIT and TIMESTAMP algorithm for the list update problem
Information Processing Letters | 1997-02-28 | Paper |
| scientific article; zbMATH DE number 910898 (Why is no real title available?) | 1996-11-04 | Paper |
| scientific article; zbMATH DE number 742994 (Why is no real title available?) | 1995-04-11 | Paper |
The complexity of one-machine batching problems
Discrete Applied Mathematics | 1994-07-25 | Paper |
