| Publication | Date of Publication | Type |
|---|
Edge-weighted online bipartite matching
Journal of the ACM | 2024-06-06 | Paper |
Submodular maximization with nearly optimal approximation, adaptivity and query complexity
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Learning Disjunctions: Near-Optimal Trade-off between Mistakes and “I Don't Knows”
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | Paper |
Online submodular welfare maximization: greedy beats 1/2 in random order
SIAM Journal on Computing | 2018-07-04 | Paper |
Consistent hashing with bounded loads
| 2018-03-15 | Paper |
Online stochastic matching with unequal probabilities
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
Constrained binary identification problem
| 2017-01-30 | Paper |
Optimal-time adaptive strong renaming, with applications to counting
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-09-11 | Paper |
Online submodular welfare maximization: greedy beats 1/2 in random order
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Randomized composable core-sets for distributed submodular maximization
Proceedings of the forty-seventh annual ACM symposium on Theory of Computing | 2015-08-21 | Paper |
Revenue maximization with nonexcludable goods
Web and Internet Economics | 2015-01-12 | Paper |
Bicriteria online matching: maximizing weight and cardinality
Web and Internet Economics | 2015-01-12 | Paper |
Minimizing movement
| 2014-12-18 | Paper |
Submodular secretary problem and extensions
ACM Transactions on Algorithms | 2014-12-05 | Paper |
Minimizing movement
ACM Transactions on Algorithms | 2014-11-18 | Paper |
The price of anarchy in network creation games
ACM Transactions on Algorithms | 2014-09-09 | Paper |
The price of anarchy in network creation games
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
Scheduling to minimize gaps and power consumption
Journal of Scheduling | 2014-02-05 | Paper |
Constant price of anarchy in network-creation games via public-service advertising
Internet Mathematics | 2012-08-29 | Paper |
The price of anarchy in cooperative network creation games
| 2012-04-24 | Paper |
On the construction of prefix-free and fix-free codes with specified codeword compositions
Discrete Applied Mathematics | 2012-03-19 | Paper |
Online stochastic weighted matching: improved approximation algorithms
Lecture Notes in Computer Science | 2011-12-05 | Paper |
\(O(1)\)-approximations for maximum movement problems
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Permutation betting markets: singleton betting with extra information
Algorithmica | 2011-07-01 | Paper |
Constant price of anarchy in network creation games via public service advertising
Algorithms and Models for the Web-Graph | 2011-01-21 | Paper |
Submodular secretary problem and extensions
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2010-09-10 | Paper |
How efficient can gossip be? (On the cost of resilient information exchange)
Automata, Languages and Programming | 2010-09-07 | Paper |
Minimizing the diameter of a network using shortcut edges
Lecture Notes in Computer Science | 2010-06-22 | Paper |
Spanning trees with minimum weighted degrees
Information Processing Letters | 2010-03-24 | Paper |
Finding an Integral vector in an Unknown Polyhedral Cone
| 2010-01-31 | Paper |
Ordinal Embedding: Approximation Algorithms and Dimensionality Reduction
Lecture Notes in Computer Science | 2008-11-27 | Paper |
