| Publication | Date of Publication | Type |
|---|
| The online median problem | 2026-05-08 | Paper |
On the spanning trees of weighted graphs
Graph-Theoretic Concepts in Computer Science | 2024-02-28 | Paper |
A super-logarithmic lower bound for hypercubic sorting networks
Automata, Languages and Programming | 2019-04-29 | Paper |
Fair on-line scheduling of a dynamic set of tasks on a single resource
Information Processing Letters | 2016-05-26 | Paper |
Proportionate progress
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
Optimal cover time for a graph-based coupon collector process
Journal of Discrete Algorithms | 2014-02-03 | Paper |
Concurrent maintenance of rings
Distributed Computing | 2013-06-20 | Paper |
Efficient adaptive collect using randomization
Distributed Computing | 2013-06-07 | Paper |
Competitive weighted matching in transversal matroids
Algorithmica | 2012-04-26 | Paper |
Maintaining the Ranch topology
Journal of Parallel and Distributed Computing | 2012-03-07 | Paper |
Buyer-supplier games: optimization over the core
Theoretical Computer Science | 2011-02-21 | Paper |
Approximation algorithms for hierarchical location problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
Fast Scheduling of Weighted Unit Jobs with Release Times and Deadlines
Automata, Languages and Programming | 2008-08-28 | Paper |
Competitive Weighted Matching in Transversal Matroids
Automata, Languages and Programming | 2008-08-28 | Paper |
Online Compression Caching
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Buyer-Supplier Games: Optimization over the Core
Approximation and Online Algorithms | 2008-02-20 | Paper |
Online hierarchical cooperative caching
Theory of Computing Systems | 2007-01-25 | Paper |
Approximation algorithms for hierarchical location problems
Journal of Computer and System Sciences | 2006-06-30 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Active and Concurrent Topology Maintenance
Lecture Notes in Computer Science | 2005-08-17 | Paper |
Optimal time bounds for approximate clustering
Machine Learning | 2005-01-19 | Paper |
The Online Median Problem
SIAM Journal on Computing | 2003-06-19 | Paper |
Proportionate progress: A notion of fairness in resource allocation
Algorithmica | 1996-10-08 | Paper |
A lower bound for sorting networks based on the shuffle permutation
Mathematical Systems Theory | 1994-10-30 | Paper |
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
Journal of Computer and System Sciences | 1994-07-27 | Paper |
Pipelined parallel prefix computations, and sorting on a pipelined hypercube
Journal of Parallel and Distributed Computing | 1993-06-29 | Paper |
