| Publication | Date of Publication | Type |
|---|
| An optimal deterministic algorithm for online b-matching | 2024-07-05 | Paper |
| A randomized algorithm for online metric b-matching | 2024-06-17 | Paper |
| Simulating teams with many conjectures | 2023-12-08 | Paper |
| The online transportation problem | 2023-05-08 | Paper |
| Online load balancing of temporary tasks | 2023-01-18 | Paper |
| A competitive analysis of nearest neighbor based algorithms for searching unknown scenes | 2022-08-18 | Paper |
| Rounds versus time for the two person pebble game | 2022-08-16 | Paper |
| Fault-tolerant real-time scheduling | 2021-12-20 | Paper |
| Constructing competitive tours from local information | 2019-03-29 | Paper |
| Fault-tolerant scheduling (extended abstract) | 2016-09-01 | Paper |
| Minimizing flow time nonclairvoyantly | 2015-11-12 | Paper |
| Learning behaviors of functions with teams | 2013-07-30 | Paper |
| A near optimal periodic transmission schedule in bounded degree wireless sensor network | 2012-12-07 | Paper |
| Learning Behaviors of Functions | 2010-05-14 | Paper |
| Algorithms - ESA 2003 | 2010-03-03 | Paper |
| Taming teams with mind changes | 2008-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3416084 | 2007-01-19 | Paper |
| Unlocking the advantages of dynamic service selection and pricing | 2006-02-08 | Paper |
| Fault-Tolerant Scheduling | 2005-09-16 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Maximizing job completions online | 2004-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472464 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4437496 | 2003-12-02 | Paper |
| Dynamic spectrum allocation: the impotency of duration notification. | 2003-07-27 | Paper |
| Speed is as powerful as clairvoyance | 2003-06-25 | Paper |
| Caching for web searching | 2002-06-17 | Paper |
| Scheduling broadcasts in wireless networks | 2002-05-14 | Paper |
| The communication complexity of enumeration, elimination, and selection | 2002-04-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753944 | 2001-12-18 | Paper |
| Eliminating migration in multi-processor scheduling | 2001-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2721975 | 2001-07-11 | Paper |
| Errata: A new algorithm for scheduling periodic, real-time tasks | 2000-12-03 | Paper |
| Fault-tolerant real-time scheduling | 2000-08-27 | Paper |
| An optimal deterministic algorithm for online \(b\)-matching | 2000-08-23 | Paper |
| The Online Transportation Problem | 2000-07-20 | Paper |
| Constructing competitive tours from local information | 2000-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252706 | 2000-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252326 | 1999-06-17 | Paper |
| On-Line Load Balancing of Temporary Tasks | 1997-03-18 | Paper |
| Not all insertion methods yield constant approximate tours in the Euclidean plane | 1994-04-05 | Paper |
| A competitive analysis of algorithms for searching unknown scenes | 1993-10-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138958 | 1993-10-20 | Paper |
| Online Weighted Matching | 1993-06-29 | Paper |
| The Probabilistic Communication Complexity of Set Intersection | 1993-04-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010311 | 1992-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010316 | 1992-09-27 | Paper |
| On the power of white pebbles | 1992-06-27 | Paper |
| Rounds versus time for the two person pebble game | 1990-01-01 | Paper |
