| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6181607 | 2024-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121903 | 2020-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743425 | 2019-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4633880 | 2019-05-06 | Paper |
| Lower Bounds for Nondeterministic Semantic Read-Once Branching Programs | 2017-12-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365025 | 2017-09-29 | Paper |
| Improved analysis of the online set cover problem with advice | 2017-09-07 | Paper |
| Scheduling in the dark | 2016-09-29 | Paper |
| Upper and lower bounds on the power of advice | 2016-08-26 | Paper |
| A maiden analysis of longest wait first | 2015-09-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501343 | 2015-08-03 | Paper |
| Time-space trade-offs for undirected st-connectivity on a JAG | 2015-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2934634 | 2014-12-18 | Paper |
| Scalably scheduling processes with arbitrary speedup curves | 2014-09-09 | Paper |
| Cake cutting really is not a piece of cake | 2014-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417666 | 2014-05-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5417620 | 2014-05-22 | Paper |
| Speed scaling of processes with arbitrary speedup curves on a multiprocessor | 2012-12-10 | Paper |
| On the competitiveness of AIMD-TCP within a general network | 2012-11-27 | Paper |
| Nonclairvoyant Speed Scaling for Flow and Energy | 2012-04-24 | Paper |
| Nonclairvoyant speed scaling for flow and energy | 2011-11-07 | Paper |
| Cake cutting really is not a piece of cake | 2010-08-16 | Paper |
| Towards asymptotic optimality in probabilistic packet marking | 2010-08-16 | Paper |
| TCP is competitive with resource augmentation | 2010-08-13 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| How to Think About Algorithms | 2009-01-14 | Paper |
| Embedding into \(l_{\infty }^{2}\) is easy, embedding into \(l_{\infty}^{3}\) is NP-complete | 2008-08-19 | Paper |
| Confidently Cutting a Cake into Approximately Fair Pieces | 2008-07-10 | Paper |
| Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics | 2007-12-20 | Paper |
| Online Algorithms to Minimize Resource Reallocations and Network Communication | 2007-08-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4828963 | 2004-11-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473270 | 2004-08-04 | Paper |
| Mining for empty spaces in large data sets. | 2003-08-17 | Paper |
| Multicast pull scheduling: When fairness is fine | 2003-08-17 | Paper |
| Communication complexity towards lower bounds on circuit depth | 2002-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234077 | 2002-01-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4234060 | 2001-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4526976 | 2001-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4252735 | 2000-04-26 | Paper |
| Tight Lower Bounds for st-Connectivity on the NNJAG Model | 1999-10-28 | Paper |
| The relative complexity of NP search problems | 1999-09-13 | Paper |
| Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata | 1998-09-21 | Paper |
| Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models | 1998-09-20 | Paper |
| Removing Ramsey theory: Lower bounds with smaller domain size | 1998-07-23 | Paper |
| Priority encoding transmission | 1997-06-12 | Paper |
