| Publication | Date of Publication | Type |
|---|
| Translationally invariant constraint optimization problems | 2024-11-19 | Paper |
| Quantum search-to-decision reductions and the state synthesis problem | 2024-07-05 | Paper |
| Modified iterative quantum amplitude estimation is asymptotically optimal | 2024-05-24 | Paper |
| Hamiltonian complexity in the thermodynamic limit | 2023-12-08 | Paper |
| Randomized algorithms for metrical task systems | 2022-12-16 | Paper |
| A competitive analysis for the start-gap algorithm for online memory wear leveling | 2021-02-04 | Paper |
| Cache Replacement with Memory Allocation | 2019-09-12 | Paper |
| Algorithms for power savings | 2018-11-05 | Paper |
| The subset assignment problem for data placement in caches | 2018-07-25 | Paper |
| The Subset Assignment Problem for Data Placement in Caches. | 2018-04-19 | Paper |
| A comparison of performance measures for online algorithms | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501806 | 2015-08-14 | Paper |
| Ground state entanglement in one-dimensional translationally invariant quantum systems | 2015-04-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191569 | 2014-10-06 | Paper |
| The Quantum and Classical Complexity of Translationally Invariant Tiling and Hamiltonian Problems | 2014-07-25 | Paper |
| A comparison of performance measures for online algorithms | 2009-10-20 | Paper |
| The power of quantum systems on a line | 2009-09-25 | Paper |
| Strip packing with precedence constraints and strip packing with release times | 2009-09-10 | Paper |
| Optimal Power-Down Strategies | 2008-10-28 | Paper |
| Probabilistic analysis for scheduling with conflicts | 2008-05-28 | Paper |
| On-line algorithms for the dynamic traveling repair problem | 2007-12-20 | Paper |
| Scheduling with conflicts on bipartite and interval graphs | 2007-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828977 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4471271 | 2004-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4801181 | 2003-04-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234110 | 2002-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4527039 | 2001-03-01 | Paper |
| Combinatorial and experimental results for randomized point matching algorithms | 1999-06-24 | Paper |
| Bounding the Power of Preemption in Randomized Scheduling | 1998-09-20 | Paper |
| Randomized algorithms for metrical task systems | 1998-08-13 | Paper |
| On algorithm design for metrical task systems | 1998-05-25 | Paper |
| Strongly Competitive Algorithms for Paging with Locality of Reference | 1997-02-03 | Paper |
| On the Value of Coordination in Distributed Decision Making | 1997-02-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4886074 | 1996-12-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4875172 | 1996-04-28 | Paper |
| Competitive paging with locality of reference | 1995-06-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763411 | 1995-04-11 | Paper |
| Coloring inductive graphs on-line | 1994-03-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4010318 | 1992-09-27 | Paper |
| On the time and space complexity of computation using write-once memory or is pen really much worse than pencil? | 1992-09-26 | Paper |
| A competitive 2-server algorithm | 1992-06-27 | Paper |
| Two results on the list update problem | 1992-06-26 | Paper |
| Reversing trains: A turn of the century sorting problem | 1989-01-01 | Paper |
