| Publication | Date of Publication | Type |
|---|
| Efficiently coloring the intersection of a general matroid and combinatorial matroids | 2026-09-16 | Paper |
| Dynamic speed scaling to manage energy and temperature | 2026-05-29 | Paper |
| Balanced allocations of cake | 2026-05-29 | Paper |
| Minimizing flow time nonclairvoyantly | 2026-05-21 | Paper |
| Relational algorithms for k-means clustering | 2026-05-12 | Paper |
Resource augmentation analysis of the greedy algorithm for the online transportation problem
Procedia Computer Science | 2025-12-11 | Paper |
Instance optimal join size estimation
Procedia Computer Science | 2025-12-02 | Paper |
| On the convergence rate of linear Datalog^ over stable semirings | 2025-11-11 | Paper |
| Online k-Median with consistent clusters | 2025-10-06 | Paper |
| SelfishMigrate: a scalable algorithm for non-clairvoyantly scheduling heterogeneous processors | 2025-08-05 | Paper |
| The geometry of scheduling | 2025-04-29 | Paper |
| An O( n)-competitive posted-price algorithm for online matching on the line | 2024-09-16 | Paper |
A competitive algorithm for throughput maximization on identical machines
Mathematical Programming. Series A. Series B | 2024-08-20 | Paper |
| An optimal deterministic algorithm for online b-matching | 2024-07-05 | Paper |
A randomized algorithm for online metric b-matching
Operations Research Letters | 2024-06-17 | Paper |
Cluster before you hallucinate: node-capacitated network design and energy efficient routing
SIAM Journal on Computing | 2024-06-05 | Paper |
| The public university secretary problem | 2024-05-29 | Paper |
scientific article; zbMATH DE number 7740917 (Why is no real title available?)
(available as arXiv preprint) | 2023-09-20 | Paper |
| An approximation algorithm for the matrix tree multiplication problem | 2023-08-08 | Paper |
The online transportation problem
Lecture Notes in Computer Science | 2023-05-08 | Paper |
Competitively pricing parking in a tree
(available as arXiv preprint) | 2023-03-21 | Paper |
Online load balancing of temporary tasks
Lecture Notes in Computer Science | 2023-01-18 | Paper |
On the impossibility of decomposing binary matroids
Operations Research Letters | 2022-10-17 | Paper |
A competitive analysis of nearest neighbor based algorithms for searching unknown scenes
STACS 92 | 2022-08-18 | Paper |
A competitive algorithm for throughput maximization on identical machines
(available as arXiv preprint) | 2022-08-16 | Paper |
| Matroid coflow scheduling | 2022-07-21 | Paper |
On the Impossibility of Decomposing Binary Matroids
(available as arXiv preprint) | 2022-06-26 | Paper |
| A poly-log competitive posted-price algorithm for online metrical matching on a spider | 2022-05-20 | Paper |
Fault-tolerant real-time scheduling
Algorithms — ESA '97 | 2021-12-20 | Paper |
The matroid intersection cover problem
Operations Research Letters | 2021-04-07 | Paper |
| Minimizing maximum flow time on related machines via dynamic posted pricing | 2020-05-27 | Paper |
| The online set aggregation problem | 2020-02-12 | Paper |
Hallucination helps: energy efficient virtual circuit routing
SIAM Journal on Computing | 2020-01-21 | Paper |
Hallucination helps: energy efficient virtual circuit routing
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
A \(o(n)\)-competitive deterministic algorithm for online matching on a line
Algorithmica | 2019-05-21 | Paper |
| Scheduling heterogeneous processors isn't as easy as you think | 2019-05-10 | Paper |
| Online scheduling with general cost functions | 2019-05-10 | Paper |
| scientific article; zbMATH DE number 7051237 (Why is no real title available?) | 2019-05-06 | Paper |
| Speed scaling with an arbitrary power function | 2019-05-06 | Paper |
Constructing competitive tours from local information
Automata, Languages and Programming | 2019-03-29 | Paper |
| The itinerant list update problem | 2019-01-15 | Paper |
Getting the best response for your erg
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Tight bounds for double coverage against weak adversaries
Theory of Computing Systems | 2018-04-12 | Paper |
Efficient computation of optimal energy and fractional weighted flow trade-off schedules
Algorithmica | 2017-10-10 | Paper |
| A 2-competitive algorithm for online convex optimization with switching costs | 2017-08-31 | Paper |
The one-dimensional Euclidean domain: finitely many obstructions are not enough
Social Choice and Welfare | 2017-05-23 | Paper |
Energy-efficient circuit design
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
| Weighted geometric set multi-cover via quasi-uniform sampling | 2017-03-30 | Paper |
| Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules | 2017-03-03 | Paper |
Optimal speed scaling with a solar cell (extended abstract)
Combinatorial Optimization and Applications | 2017-02-01 | Paper |
| scientific article; zbMATH DE number 6677416 (Why is no real title available?) | 2017-01-24 | Paper |
Fault-tolerant scheduling (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Chasing convex bodies and functions
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Tight Bounds for Double Coverage Against Weak Adversaries
Approximation and Online Algorithms | 2016-02-26 | Paper |
A \(o(n)\)-competitive deterministic algorithm for online matching on a line
Approximation and Online Algorithms | 2015-11-20 | Paper |
Minimizing flow time nonclairvoyantly
Journal of the ACM | 2015-11-12 | Paper |
On the complexity of speed scaling
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Almost all functions require exponential energy
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | 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 |
Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
Proceedings of the forty-sixth annual ACM symposium on Theory of computing | 2015-06-26 | Paper |
The geometry of scheduling
SIAM Journal on Computing | 2015-02-09 | Paper |
The geometry of scheduling
SIAM Journal on Computing | 2015-02-09 | Paper |
| Speed scaling for weighted flow time | 2014-12-18 | Paper |
Speed scaling with an arbitrary power function
ACM Transactions on Algorithms | 2014-12-05 | 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 |
Online scheduling with general cost functions
SIAM Journal on Computing | 2014-06-04 | Paper |
Online primal-dual for non-linear optimization with applications to speed scaling
Approximation and Online Algorithms | 2013-09-13 | Paper |
Multicast routing for energy minimization using speed scaling
Lecture Notes in Computer Science | 2013-04-19 | Paper |
Shortest-elapsed-time-first on a multiprocessor
Lecture Notes in Computer Science | 2013-04-19 | Paper |
The Complexity of Scheduling for p-Norms of Flow and Stretch
Integer Programming and Combinatorial Optimization | 2013-03-19 | Paper |
Speed scaling of processes with arbitrary speedup curves on a multiprocessor
Theory of Computing Systems | 2012-12-10 | Paper |
Improved bounds for speed scaling in devices obeying the cube-root rule
Theory of Computing | 2012-09-27 | Paper |
Weighted geometric set multi-cover via quasi-uniform sampling
Algorithms – ESA 2012 | 2012-09-25 | Paper |
Speed scaling for stretch plus energy
Operations Research Letters | 2012-08-17 | Paper |
The power of fair pricing mechanisms
Algorithmica | 2012-04-26 | Paper |
| Nonclairvoyant speed scaling for flow and energy | 2012-04-24 | Paper |
Nonclairvoyant speed scaling for flow and energy
Algorithmica | 2011-11-07 | Paper |
Average rate speed scaling
Algorithmica | 2011-07-01 | Paper |
Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
SIAM Journal on Computing | 2011-04-04 | Paper |
Open problems in real-time scheduling
Journal of Scheduling | 2011-04-01 | Paper |
Competitive algorithms for due date scheduling
Algorithmica | 2011-03-30 | Paper |
Minimizing maximum flowtime of jobs with arbitrary parallelizability
Approximation and Online Algorithms | 2011-02-15 | Paper |
How to schedule when you have to buy your energy
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
Scalably Scheduling Power-Heterogeneous Processors
Automata, Languages and Programming | 2010-09-07 | Paper |
Speed scaling for weighted flow time
SIAM Journal on Computing | 2010-09-06 | Paper |
Server scheduling in the L <sub>p</sub> norm
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | 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 |
The power of fair pricing mechanisms
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Semi-clairvoyant scheduling
Lecture Notes in Computer Science | 2010-03-03 | Paper |
Speed scaling with a solar cell
Theoretical Computer Science | 2009-11-04 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Speed scaling to manage energy and temperature
Journal of the ACM | 2008-12-21 | Paper |
Speed Scaling with a Solar Cell
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Confidently Cutting a Cake into Approximately Fair Pieces
Algorithmic Aspects in Information and Management | 2008-07-10 | Paper |
Speed scaling of tasks with precedence constraints
Theory of Computing Systems | 2008-06-06 | Paper |
The Price of Stochastic Anarchy
Algorithmic Game Theory | 2008-05-02 | Paper |
The Online Transportation Problem: On the Exponential Boost of One Extra Server
Lecture Notes in Computer Science | 2008-04-15 | Paper |
