| Publication | Date of Publication | Type |
|---|
| Maintaining matroid intersections online | 2024-11-28 | Paper |
| A (slightly) improved approximation algorithm for the metric traveling salesperson problem (invited talk) | 2024-11-14 | Paper |
| Matroid partition property and the secretary problem | 2024-09-25 | Paper |
Combinatorial auctions with interdependent valuations: SOS to the rescue
Mathematics of Operations Research | 2024-06-27 | Paper |
An improved approximation algorithm for the minimum k -edge connected multi-subgraph problem
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
A (slightly) improved approximation algorithm for metric TSP
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
A deterministic better-than-3/2 approximation algorithm for metric TSP
Integer Programming and Combinatorial Optimization | 2023-11-09 | Paper |
Competition alleviates present bias in task completion
(available as arXiv preprint) | 2023-03-21 | Paper |
Simple pricing schemes for consumers with evolving values
Games and Economic Behavior | 2022-07-15 | Paper |
| Beyond Competitive Analysis | 2022-02-04 | Paper |
| Matroid Partition Property and the Secretary Problem | 2021-11-24 | Paper |
| A (Slightly) Improved Bound on the Integrality Gap of the Subtour LP for TSP | 2021-05-20 | Paper |
An improved approximation algorithm for TSP in the half integral case
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
A simply exponential upper bound on the maximum number of stable matchings
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
An Improved Approximation Algorithm for TSP in the Half Integral Case
(available as arXiv preprint) | 2019-08-01 | Paper |
Simple Pricing Schemes For Consumers With Evolving Values
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
| Carpooling in social networks | 2017-12-19 | Paper |
Stability of service under time-of-use pricing
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing | 2017-08-17 | Paper |
| Game theory, alive | 2017-06-02 | Paper |
Approaching utopia, strong truthfulness and externality-resistant mechanisms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science | 2017-05-16 | Paper |
A Prior-Independent Revenue-Maximizing Auction for Multiple Additive Bidders
Web and Internet Economics | 2017-02-10 | Paper |
Balanced allocations (extended abstract)
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
On the fault tolerance of the butterfly
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
Spectral analysis of data
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Dynamic TCP acknowledgement and other stories about e/(e-1)
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
| Cheap labor can be expensive | 2014-12-18 | Paper |
| On profit-maximizing envy-free pricing | 2014-10-13 | Paper |
Random walks with “back buttons” (extended abstract)
Proceedings of the thirty-second annual ACM symposium on Theory of computing | 2014-09-26 | Paper |
On Revenue Maximization for Agents with Costly Information Acquisition
Automata, Languages, and Programming | 2013-08-07 | Paper |
Integrality gaps of linear and semi-definite programming relaxations for knapsack
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
| scientific article; zbMATH DE number 5764885 (Why is no real title available?) | 2010-08-06 | Paper |
Competitive generalized auctions
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
Algorithms for data migration
Algorithmica | 2010-03-23 | Paper |
On Revenue Maximization in Second-Price Ad Auctions
Lecture Notes in Computer Science | 2009-10-29 | Paper |
Approximating Matches Made in Heaven
Automata, Languages and Programming | 2009-07-14 | Paper |
| scientific article; zbMATH DE number 5343728 (Why is no real title available?) | 2008-09-12 | Paper |
Improved Approximation Algorithms for Budgeted Allocations
Automata, Languages and Programming | 2008-08-28 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
Dynamic TCP acknowledgment and other stories about \(e/(e-1)\)
Algorithmica | 2003-08-17 | Paper |
| scientific article; zbMATH DE number 1947375 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1947406 (Why is no real title available?) | 2003-07-08 | Paper |
| scientific article; zbMATH DE number 1931813 (Why is no real title available?) | 2003-06-20 | Paper |
Random walks with ``back buttons
The Annals of Applied Probability | 2003-05-06 | Paper |
| scientific article; zbMATH DE number 1893573 (Why is no real title available?) | 2003-04-07 | Paper |
On list update and work function algorithms.
Theoretical Computer Science | 2003-01-21 | Paper |
| scientific article; zbMATH DE number 1848399 (Why is no real title available?) | 2003-01-05 | Paper |
| scientific article; zbMATH DE number 1263239 (Why is no real title available?) | 2002-02-03 | Paper |
| On algorithms for efficient data migration | 2002-01-30 | Paper |
| scientific article; zbMATH DE number 1256657 (Why is no real title available?) | 2002-01-16 | Paper |
Markov Paging
SIAM Journal on Computing | 2000-10-18 | Paper |
Near-Optimal Parallel Prefetching and Caching
SIAM Journal on Computing | 2000-03-19 | Paper |
Balanced Allocations
SIAM Journal on Computing | 1999-10-28 | Paper |
A note on the influence of an \(\epsilon\)-biased random source
Journal of Computer and System Sciences | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1256656 (Why is no real title available?) | 1999-06-15 | Paper |
Strongly Competitive Algorithms for Paging with Locality of Reference
SIAM Journal on Computing | 1997-02-03 | Paper |
Biased random walks
Combinatorica | 1996-09-16 | Paper |
| scientific article; zbMATH DE number 795112 (Why is no real title available?) | 1996-01-15 | Paper |
| scientific article; zbMATH DE number 742969 (Why is no real title available?) | 1995-04-11 | Paper |
On-line load balancing
Theoretical Computer Science | 1995-04-04 | Paper |
Competitive randomized algorithms for nonuniform problems
Algorithmica | 1995-02-13 | Paper |
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing | 1994-10-17 | Paper |
| scientific article; zbMATH DE number 432777 (Why is no real title available?) | 1994-09-19 | Paper |
| scientific article; zbMATH DE number 432749 (Why is no real title available?) | 1994-09-19 | Paper |
Trading Space for Time in Undirected s-t Connectivity
SIAM Journal on Computing | 1994-06-16 | Paper |
| scientific article; zbMATH DE number 432843 (Why is no real title available?) | 1993-10-20 | Paper |
Bounds on the cover time
Journal of Theoretical Probability | 1989-01-01 | Paper |
Parallel hashing
Journal of the ACM | 1988-01-01 | Paper |
Algorithms for the compilation of regular expressions into PLAs
Algorithmica | 1987-01-01 | Paper |
