| Publication | Date of Publication | Type |
|---|
An \(\alpha \)-regret analysis of adversarial bilateral trade
Artificial Intelligence | 2025-01-17 | Paper |
Multi layer peeling for linear arrangement and hierarchical clustering
| 2024-11-14 | Paper |
Distortion-oblivious algorithms for scheduling on multiple machines
| 2024-09-11 | Paper |
Online graph algorithms with predictions
| 2024-07-19 | Paper |
Distortion-oblivious algorithms for minimizing flow time
| 2024-07-19 | Paper |
Competitive vertex recoloring
| 2024-06-24 | Paper |
scientific article; zbMATH DE number 7788358 (Why is no real title available?)
| 2024-01-15 | Paper |
Flow time scheduling with uncertain processing time
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Competitive vertex recoloring. (Online disengagement)
Algorithmica | 2023-06-28 | Paper |
scientific article; zbMATH DE number 7651147 (Why is no real title available?)
| 2023-02-07 | Paper |
The loss of serving in the dark
Information Processing Letters | 2023-01-30 | Paper |
Online load balancing of temporary tasks
Lecture Notes in Computer Science | 2023-01-18 | Paper |
On two dimensional packing
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
Online service with delay
ACM Transactions on Algorithms | 2022-02-16 | Paper |
On-line machine covering
Algorithms — ESA '97 | 2021-12-20 | Paper |
Min-cost bipartite perfect matching with delays
| 2021-07-28 | Paper |
Deterministic min-cost matching with delays
Theory of Computing Systems | 2020-06-02 | Paper |
An improved algorithm for online machine minimization
Operations Research Letters | 2019-06-11 | Paper |
Online Mixed Packing and Covering
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
The strategy of experts for repeated predictions
Web and Internet Economics | 2019-01-30 | Paper |
Deterministic min-cost matching with delays
Lecture Notes in Computer Science | 2019-01-15 | Paper |
2-approximation algorithm for a generalization of scheduling on unrelated parallel machines
Information Processing Letters | 2018-10-19 | Paper |
Online lower bounds via duality
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Polylogarithmic Bounds on the Competitiveness of Min-cost Perfect Matching with Delays
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Packing small vectors
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Make-to-order integrated scheduling and distribution
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Randomized algorithms for online vector load balancing
| 2018-03-15 | Paper |
Liquid price of anarchy
| 2018-02-13 | Paper |
On-line competitive algorithms for call admission in optical networks
Algorithms — ESA '96 | 2017-12-05 | Paper |
Scheduling with deadlines and buffer management with processing requirements
Algorithmica | 2017-10-10 | Paper |
scientific article; zbMATH DE number 6783452 (Why is no real title available?)
| 2017-09-29 | Paper |
Online service with delay
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
Sequential decision making with vector outcomes
Proceedings of the 5th conference on Innovations in theoretical computer science | 2017-05-19 | Paper |
Truthful mechanism design via correlated tree rounding
Mathematical Programming. Series A. Series B | 2017-05-15 | Paper |
Dynamic traveling repair problem with an arbitrary time window
Approximation and Online Algorithms | 2017-04-04 | Paper |
Generalized Reordering Buffer Management
| 2017-03-03 | Paper |
Minimizing the flow time without migration
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Balanced allocations (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
How to allocate goods in an online market?
Algorithmica | 2016-03-29 | Paper |
Buffer management for packets with processing times
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Serving in the dark should be done non-uniformly
Automata, Languages, and Programming | 2015-10-27 | Paper |
Distributed error confinement
Proceedings of the twenty-second annual symposium on Principles of distributed computing | 2015-09-04 | Paper |
An improved algorithm for CIOQ switches
ACM Transactions on Algorithms | 2015-09-02 | Paper |
A general approach to online network optimization problems
ACM Transactions on Algorithms | 2015-09-02 | Paper |
scientific article; zbMATH DE number 6472625 (Why is no real title available?)
| 2015-08-14 | Paper |
scientific article; zbMATH DE number 6469194 (Why is no real title available?)
| 2015-08-03 | Paper |
On-line load balancing with applications to machine scheduling and virtual circuit routing
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Spectral analysis of data
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Multiple intents re-ranking
Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
Truthful unsplittable flow for large capacity networks
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Admission control to minimize rejections and online set cover with repetitions
ACM Transactions on Algorithms | 2014-11-18 | Paper |
Distributed error confinement
ACM Transactions on Algorithms | 2014-11-18 | Paper |
The loss of serving in the dark
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Tight bounds for online vector bin packing
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2014-08-07 | Paper |
Convergence of local dynamics to balanced outcomes in exchange networks
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Efficient Submodular Function Maximization under Linear Packing Constraints
Automata, Languages, and Programming | 2013-08-12 | Paper |
The price of routing unsplittable flow
SIAM Journal on Computing | 2013-07-04 | Paper |
Buffer management for colored packets with deadlines
Theory of Computing Systems | 2012-12-10 | Paper |
Prompt mechanism for ad placement over time
Algorithmic Game Theory | 2011-10-28 | Paper |
Submodular Max-SAT
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Optimal discovery strategies in white space networks
Algorithms – ESA 2011 | 2011-09-16 | Paper |
Maximum bipartite flow in networks with adaptive channel width
Theoretical Computer Science | 2011-06-07 | Paper |
Combining online algorithms for acceptance and rejection
Theory of Computing | 2011-05-24 | Paper |
Management of multi-queue switches in QoS networks
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The price of routing unsplittable flow
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Convex programming for scheduling unrelated parallel machines
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The online set cover problem
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Reducing truth-telling online mechanisms to online optimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
The zero-one principle for switching networks
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing | 2010-08-15 | Paper |
scientific article; zbMATH DE number 5764886 (Why is no real title available?)
| 2010-08-06 | Paper |
A preemptive algorithm for maximizing disjoint paths on trees
Algorithmica | 2010-05-19 | Paper |
The online set cover problem
SIAM Journal on Computing | 2010-04-29 | Paper |
On Revenue Maximization in Second-Price Ad Auctions
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Tell me who I am: An interactive recommendation system
Theory of Computing Systems | 2009-10-19 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Maximum Bipartite Flow in Networks with Adaptive Channel Width
Automata, Languages and Programming | 2009-07-14 | Paper |
Truthful Unification Framework for Packing Integer Programs with Choices
Automata, Languages and Programming | 2008-08-28 | Paper |
Improved Approximation Algorithms for Budgeted Allocations
Automata, Languages and Programming | 2008-08-28 | Paper |
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Optimal Node Routing
STACS 2006 | 2008-03-19 | Paper |
Collaborate with strangers to find own preferences
Theory of Computing Systems | 2008-02-18 | Paper |
Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms
Journal of Scheduling | 2007-12-20 | Paper |
Multiplexing Packets with Arbitrary Deadlines in Bounded Buffers
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Truthful approximation mechanisms for scheduling selfish related machines
Theory of Computing Systems | 2007-08-23 | Paper |
Maximizing throughput in multi-queue switches
Algorithmica | 2007-06-21 | Paper |
scientific article; zbMATH DE number 5159825 (Why is no real title available?)
| 2007-05-31 | Paper |
Minimizing total flow time and total completion time with immediate dispatching
Algorithmica | 2007-04-26 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2007-02-12 | Paper |
An improved algorithm for online coloring of intervals with bandwidth
Theoretical Computer Science | 2007-01-09 | Paper |
Load balancing of temporary tasks in the \(\ell _{p}\) norm
Theoretical Computer Science | 2006-09-14 | Paper |
Tradeoffs in worst-case equilibria
Theoretical Computer Science | 2006-09-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
Combinatorial algorithms for the unsplittable flow problem
Algorithmica | 2006-06-14 | Paper |
Management of multi-queue switches in QoS networks
Algorithmica | 2006-03-21 | Paper |
Approximation and Online Algorithms
Lecture Notes in Computer Science | 2005-12-14 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Algorithm Theory - SWAT 2004
Lecture Notes in Computer Science | 2005-09-07 | Paper |
Algorithms – ESA 2004
Lecture Notes in Computer Science | 2005-08-18 | Paper |
On-Line Load Balancing of Temporary Tasks on Identical Machines
SIAM Journal on Discrete Mathematics | 2005-02-28 | Paper |
scientific article; zbMATH DE number 2119652 (Why is no real title available?)
| 2004-11-29 | Paper |
On-line generalized Steiner problem
Theoretical Computer Science | 2004-11-23 | Paper |
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences | 2004-11-18 | Paper |
scientific article; zbMATH DE number 2102767 (Why is no real title available?)
| 2004-09-24 | Paper |
All-norm approximation algorithms
Journal of Algorithms | 2004-09-08 | Paper |
All-Norm Approximation Algorithms
Algorithm Theory — SWAT 2002 | 2004-08-12 | Paper |
scientific article; zbMATH DE number 2080515 (Why is no real title available?)
| 2004-08-04 | Paper |
Temporary tasks assignment resolved
Algorithmica | 2003-08-17 | Paper |
Resource augmentation in load balancing.
Journal of Scheduling | 2003-07-27 | Paper |
On-line restricted assignment of temporary tasks with unknown durations.
Information Processing Letters | 2003-01-21 | Paper |
Off-line temporary tasks assignment.
Theoretical Computer Science | 2003-01-21 | Paper |
Minimizing the Flow Time Without Migration
SIAM Journal on Computing | 2002-09-29 | Paper |
Fair versus unrestricted bin packing
Algorithmica | 2002-09-25 | Paper |
On-line scheduling with precedence constraints
Discrete Applied Mathematics | 2002-06-24 | Paper |
scientific article; zbMATH DE number 1757944 (Why is no real title available?)
| 2002-06-20 | Paper |
Maximizing job benefits on-line
Journal of Scheduling | 2002-05-14 | Paper |
Competitive routing of virtual circuits with unknown duration
Journal of Computer and System Sciences | 2002-04-28 | Paper |
On-line bin-stretching
Theoretical Computer Science | 2002-03-03 | Paper |
scientific article; zbMATH DE number 1256657 (Why is no real title available?)
| 2002-01-16 | Paper |
scientific article; zbMATH DE number 1670528 (Why is no real title available?)
| 2001-11-11 | Paper |
On-line competitive algorithms for call admission in optical networks
Algorithmica | 2001-10-14 | Paper |
Ancient and new algorithms for load balancing in the \(\ell_p\) norm
Algorithmica | 2001-10-07 | Paper |
scientific article; zbMATH DE number 1617258 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1617259 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1617256 (Why is no real title available?)
| 2001-07-11 | Paper |
scientific article; zbMATH DE number 1305386 (Why is no real title available?)
| 2000-10-17 | Paper |
scientific article; zbMATH DE number 1418264 (Why is no real title available?)
| 2000-03-19 | Paper |
On capital investment.
Algorithmica | 2000-01-04 | Paper |
scientific article; zbMATH DE number 1303584 (Why is no real title available?)
| 1999-12-07 | Paper |
Balanced Allocations
SIAM Journal on Computing | 1999-10-28 | Paper |
scientific article; zbMATH DE number 1256771 (Why is no real title available?)
| 1999-10-04 | Paper |
scientific article; zbMATH DE number 1263203 (Why is no real title available?)
| 1999-09-15 | Paper |
Approximating probability distributions using small sample spaces
Combinatorica | 1999-05-18 | Paper |
scientific article; zbMATH DE number 1182760 (Why is no real title available?)
| 1999-05-05 | Paper |
On-line machine covering
Journal of Scheduling | 1998-11-01 | Paper |
Approximation schemes for scheduling on parallel machines
Journal of Scheduling | 1998-11-01 | Paper |
On-line and off-line approximation algorithms for vector covering problems
Algorithmica | 1998-10-01 | Paper |
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
SIAM Journal on Computing | 1998-09-21 | Paper |
On-line routing of virtual circuits with applications to load balancing and machine scheduling
Journal of the ACM | 1998-02-17 | Paper |
On Two Dimensional Packing
Journal of Algorithms | 1997-12-18 | Paper |
scientific article; zbMATH DE number 1003263 (Why is no real title available?)
| 1997-04-23 | Paper |
On-Line Load Balancing of Temporary Tasks
Journal of Algorithms | 1997-03-18 | Paper |
Biased random walks
Combinatorica | 1996-09-16 | Paper |
scientific article; zbMATH DE number 871901 (Why is no real title available?)
| 1996-04-28 | Paper |
Routing strategies for fast networks
IEEE Transactions on Computers | 1996-01-01 | Paper |
Lower Bounds for Insertion Methods for TSP
Combinatorics, Probability and Computing | 1995-05-01 | Paper |
scientific article; zbMATH DE number 742987 (Why is no real title available?)
| 1995-04-11 | Paper |
scientific article; zbMATH DE number 742966 (Why is no real title available?)
| 1995-04-11 | Paper |
On-line load balancing
Theoretical Computer Science | 1995-04-04 | Paper |
The Competitiveness of On-Line Assignments
Journal of Algorithms | 1995-01-01 | Paper |
On the problem of approximating the number of bases of a matroid
Information Processing Letters | 1994-05-26 | Paper |
scientific article; zbMATH DE number 437568 (Why is no real title available?)
| 1993-12-15 | Paper |
On-line Steiner trees in the Euclidean plane
Discrete & Computational Geometry | 1993-09-30 | Paper |
Lower Bounds for Threshold and Symmetric Functions in Parallel Computation
SIAM Journal on Computing | 1992-06-28 | Paper |
Parallel comparison algorithms for approximation problems
Combinatorica | 1991-01-01 | Paper |
Parallel comparison merging of many-ordered lists
Theoretical Computer Science | 1991-01-01 | Paper |
Parallel selection
Discrete Applied Mathematics | 1990-01-01 | Paper |
Universal sequences for complete graphs
Discrete Applied Mathematics | 1990-01-01 | Paper |
Finding an Approximate Maximum
SIAM Journal on Computing | 1989-01-01 | Paper |
Sorting, Approximate Sorting, and Searching in Rounds
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
The Average Complexity of Deterministic and Randomized Parallel Comparison-Sorting Algorithms
SIAM Journal on Computing | 1988-01-01 | Paper |
Tight Comparison Bounds on the Complexity of Parallel Sorting
SIAM Journal on Computing | 1987-01-01 | Paper |
