| Publication | Date of Publication | Type |
|---|
Reliability of Digitized Quantum Annealing and the Decay of Entanglement
Annalen der Physik | 2023-10-30 | Paper |
Process tomography of robust dynamical decoupling with superconducting qubits
Quantum Information Processing | 2023-03-17 | Paper |
Tradeoffs and average-case equilibria in selfish routing
ACM Transactions on Computation Theory | 2015-09-24 | Paper |
On adequate performance measures for paging
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing | 2014-11-25 | Paper |
| SRPT is 1.86-competitive for completion time scheduling | 2014-05-22 | Paper |
The bell is ringing in speed-scaled multiprocessor scheduling
Theory of Computing Systems | 2014-03-25 | Paper |
Approximation Algorithms for Generalized Plant Location
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| Quantum discord determines the interferometric power of quantum states | 2013-09-05 | Paper |
Quantum delayed-choice experiment in an environment with arbitrary white noise
Journal of Physics A: Mathematical and Theoretical | 2013-07-11 | Paper |
Buffer overflow management with class segregation
Information Processing Letters | 2013-03-20 | Paper |
Approximation algorithms for generalized and variable-sized bin covering
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2012-11-02 | Paper |
| Optimal algorithms for train shunting and relaxed list update problems | 2012-10-02 | Paper |
| A Constructive Proof of the Cycle Double Cover Conjecture | 2012-02-02 | Paper |
| Balanced interval coloring | 2012-01-23 | Paper |
Balanced interval coloring
(available as arXiv preprint) | 2012-01-23 | Paper |
Optimal File-Distribution in Heterogeneous and Asymmetric Storage Networks
SOFSEM 2011: Theory and Practice of Computer Science | 2011-02-15 | Paper |
APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
Discrete Mathematics, Algorithms and Applications | 2009-09-22 | Paper |
On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case Analysis
Lecture Notes in Computer Science | 2009-07-23 | Paper |
A 5/3-Approximation Algorithm for Joint Replenishment with Deadlines
Combinatorial Optimization and Applications | 2009-07-07 | Paper |
Latency Constrained Aggregation in Chain Networks Admits a PTAS
Algorithmic Aspects in Information and Management | 2009-07-02 | Paper |
Tradeoffs and Average-Case Equilibria in Selfish Routing
Algorithms – ESA 2007 | 2008-09-25 | Paper |
The Influence of Link Restrictions on (Random) Selfish Routing
Algorithmic Game Theory | 2008-05-02 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Combinatorics, Probability and Computing | 2007-03-20 | Paper |
The expected competitive ratio for weighted completion time scheduling
Theory of Computing Systems | 2006-10-25 | Paper |
