| Publication | Date of Publication | Type |
|---|
| How to think about algorithms | 2024-01-03 | Paper |
| scientific article; zbMATH DE number 7250155 (Why is no real title available?) | 2020-09-22 | Paper |
| A little advice can be very helpful | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7051237 (Why is no real title available?) | 2019-05-06 | Paper |
| Lower bounds for nondeterministic semantic read-once branching programs | 2017-12-19 | Paper |
| Online scalable scheduling for the \(\ell_k\)-norms of flow time without conservation of work | 2017-09-29 | Paper |
Improved analysis of the online set cover problem with advice
Theoretical Computer Science | 2017-09-07 | Paper |
Scheduling in the dark
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Upper and lower bounds on the power of advice
SIAM Journal on Computing | 2016-08-26 | Paper |
A maiden analysis of longest wait first
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| A maiden analysis of longest wait first | 2015-08-03 | Paper |
Time-space trade-offs for undirected <i>st</i>-connectivity on a JAG
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
| scientific article; zbMATH DE number 6381680 (Why is no real title available?) | 2014-12-18 | Paper |
Scalably scheduling processes with arbitrary speedup curves
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Cake cutting really is not a piece of cake
ACM Transactions on Algorithms | 2014-09-09 | Paper |
| Bounding variance and expectation of longest path lengths in dags | 2014-05-22 | Paper |
| Inapproximability for planar embedding problems | 2014-05-22 | Paper |
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Theory of Computing Systems | 2012-12-10 | Paper |
On the competitiveness of AIMD-TCP within a general network
Theoretical Computer Science | 2012-11-27 | Paper |
| Nonclairvoyant speed scaling for flow and energy | 2012-04-24 | Paper |
Nonclairvoyant speed scaling for flow and energy
Algorithmica | 2011-11-07 | Paper |
Cake cutting really is not a piece of cake
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
Towards asymptotic optimality in probabilistic packet marking
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
TCP is competitive with resource augmentation
Theory of Computing Systems | 2010-08-13 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 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
Discrete & Computational Geometry | 2008-08-19 | Paper |
Confidently Cutting a Cake into Approximately Fair Pieces
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Non-clairvoyant multiprocessor scheduling of jobs with changing execution characteristics
Journal of Scheduling | 2007-12-20 | Paper |
Online Algorithms to Minimize Resource Reallocations and Network Communication
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2007-08-28 | Paper |
| scientific article; zbMATH DE number 2119692 (Why is no real title available?) | 2004-11-29 | Paper |
| scientific article; zbMATH DE number 2080472 (Why is no real title available?) | 2004-08-04 | Paper |
Mining for empty spaces in large data sets.
Theoretical Computer Science | 2003-08-17 | Paper |
Multicast pull scheduling: When fairness is fine
Algorithmica | 2003-08-17 | Paper |
Communication complexity towards lower bounds on circuit depth
Computational Complexity | 2002-06-17 | Paper |
| scientific article; zbMATH DE number 1263206 (Why is no real title available?) | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1263190 (Why is no real title available?) | 2001-08-27 | Paper |
| scientific article; zbMATH DE number 1559528 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1306883 (Why is no real title available?) | 2000-04-26 | Paper |
Tight Lower Bounds for <i>st</i>-Connectivity on the NNJAG Model
SIAM Journal on Computing | 1999-10-28 | Paper |
The relative complexity of NP search problems
Journal of Computer and System Sciences | 1999-09-13 | Paper |
Time--Space Tradeoffs For Undirected st-Connectivity on a Graph Automata
SIAM Journal on Computing | 1998-09-21 | Paper |
Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models
SIAM Journal on Computing | 1998-09-20 | Paper |
Removing Ramsey theory: Lower bounds with smaller domain size
Theoretical Computer Science | 1998-07-23 | Paper |
Priority encoding transmission
IEEE Transactions on Information Theory | 1997-06-12 | Paper |
