| Publication | Date of Publication | Type |
|---|
| Minimizing flow time nonclairvoyantly | 2026-05-21 | Paper |
| An optimal deterministic algorithm for online b-matching | 2024-07-05 | Paper |
A randomized algorithm for online metric b-matching
Operations Research Letters | 2024-06-17 | Paper |
Simulating teams with many conjectures
Lecture Notes in Computer Science | 2023-12-08 | Paper |
The online transportation problem
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Online load balancing of temporary tasks
Lecture Notes in Computer Science | 2023-01-18 | Paper |
A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
STACS 92 | 2022-08-18 | Paper |
Rounds versus time for the two person pebble game (extended abstract)
STACS 89 | 2022-08-16 | Paper |
Fault-tolerant real-time scheduling
Algorithms — ESA '97 | 2021-12-20 | Paper |
Constructing competitive tours from local information
Automata, Languages and Programming | 2019-03-29 | Paper |
Fault-tolerant scheduling (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Minimizing flow time nonclairvoyantly
Journal of the ACM | 2015-11-12 | Paper |
Learning behaviors of functions with teams
Fundamenta Informaticae | 2013-07-30 | Paper |
A near optimal periodic transmission schedule in bounded degree wireless sensor network
Theory of Computing Systems | 2012-12-07 | Paper |
Learning Behaviors of Functions
Fundamenta Informaticae | 2010-05-14 | Paper |
Algorithms - ESA 2003
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Taming teams with mind changes
Journal of Computer and System Sciences | 2008-06-10 | Paper |
| scientific article; zbMATH DE number 5117078 (Why is no real title available?) | 2007-01-19 | Paper |
Unlocking the advantages of dynamic service selection and pricing
Theory of Computing Systems | 2006-02-08 | Paper |
Fault-Tolerant Scheduling
SIAM Journal on Computing | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Maximizing job completions online
Journal of Algorithms | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 2080221 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2011844 (Why is no real title available?) | 2003-12-02 | Paper |
Dynamic spectrum allocation: the impotency of duration notification.
Journal of Scheduling | 2003-07-27 | Paper |
Speed is as powerful as clairvoyance
Journal of the ACM | 2003-06-25 | Paper |
Caching for web searching
Algorithmica | 2002-06-17 | Paper |
Scheduling broadcasts in wireless networks
Journal of Scheduling | 2002-05-14 | Paper |
The communication complexity of enumeration, elimination, and selection
Journal of Computer and System Sciences | 2002-04-11 | Paper |
| scientific article; zbMATH DE number 1670667 (Why is no real title available?) | 2001-12-18 | Paper |
Eliminating migration in multi-processor scheduling
Journal of Algorithms | 2001-10-07 | Paper |
| scientific article; zbMATH DE number 1617255 (Why is no real title available?) | 2001-07-11 | Paper |
Errata: A new algorithm for scheduling periodic, real-time tasks
Algorithmica | 2000-12-03 | Paper |
Fault-tolerant real-time scheduling
Algorithmica | 2000-08-27 | Paper |
An optimal deterministic algorithm for online \(b\)-matching
Theoretical Computer Science | 2000-08-23 | Paper |
The Online Transportation Problem
SIAM Journal on Discrete Mathematics | 2000-07-20 | Paper |
Constructing competitive tours from local information
Theoretical Computer Science | 2000-06-21 | Paper |
| scientific article; zbMATH DE number 1306855 (Why is no real title available?) | 2000-04-26 | Paper |
| scientific article; zbMATH DE number 1305442 (Why is no real title available?) | 1999-06-17 | Paper |
On-Line Load Balancing of Temporary Tasks
Journal of Algorithms | 1997-03-18 | Paper |
Not all insertion methods yield constant approximate tours in the Euclidean plane
Theoretical Computer Science | 1994-04-05 | Paper |
A competitive analysis of algorithms for searching unknown scenes
Computational Geometry | 1993-10-24 | Paper |
| scientific article; zbMATH DE number 432824 (Why is no real title available?) | 1993-10-20 | Paper |
Online Weighted Matching
Journal of Algorithms | 1993-06-29 | Paper |
The Probabilistic Communication Complexity of Set Intersection
SIAM Journal on Discrete Mathematics | 1993-04-01 | Paper |
| scientific article; zbMATH DE number 65700 (Why is no real title available?) | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 65705 (Why is no real title available?) | 1992-09-27 | Paper |
On the power of white pebbles
Combinatorica | 1992-06-27 | Paper |
Rounds versus time for the two person pebble game
Information and Computation | 1990-01-01 | Paper |
