| Publication | Date of Publication | Type |
|---|
| Repairing databases over metric spaces with coincidence constraints | 2026-07-08 | Paper |
| Near-optimal schedules for simultaneous multicasts | 2026-05-12 | Paper |
| The greedy algorithm is not optimal for on-line edge coloring | 2026-05-12 | Paper |
| The average-value allocation problem | 2025-10-06 | Paper |
| Network coding gaps for completion times of multiple unicasts | 2025-08-12 | Paper |
| Online matching with general arrivals | 2025-08-12 | Paper |
| Tight bounds for online edge coloring | 2025-08-12 | Paper |
Dynamic matching with better-than-2 approximation in polylogarithmic update time
Journal of the ACM | 2025-04-25 | Paper |
| Combinatorial stationary prophet inequalities | 2024-11-28 | Paper |
Improved online contention resolution for matchings and applications to the gig economy
Mathematics of Operations Research | 2024-11-07 | Paper |
Online stochastic max-weight bipartite matching: beyond prophet inequalities
Mathematics of Operations Research | 2024-11-07 | Paper |
| Simplified and space-optimal semi-streaming (2+)-approximate matching | 2024-08-26 | Paper |
| Simple and asymptotically optimal online bipartite edge coloring | 2024-05-29 | Paper |
| Dynamic matching with better-than-2 approximation in polylogarithmic update time | 2024-05-14 | Paper |
| Lossless online rounding for online bipartite matching (despite its impossibility) | 2024-05-14 | Paper |
scientific article; zbMATH DE number 7829343 (Why is no real title available?)
(available as arXiv preprint) | 2024-04-09 | Paper |
scientific article; zbMATH DE number 7788452 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
scientific article; zbMATH DE number 7788506 (Why is no real title available?)
(available as arXiv preprint) | 2024-01-15 | Paper |
Universally-optimal distributed algorithms for known topologies
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Stochastic online metric matching
(available as arXiv preprint) | 2022-07-21 | Paper |
Dynamic matching: reducing integral algorithms to approximately-maximal fractional algorithms
(available as arXiv preprint) | 2021-07-28 | Paper |
| Fully-dynamic bin packing with little repacking | 2021-07-28 | Paper |
Rounding dynamic matchings against an adaptive adversary
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
Round- and message-optimal distributed graph algorithms
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing | 2019-09-19 | Paper |
| scientific article; zbMATH DE number 6850371 (Why is no real title available?) | 2018-03-15 | Paper |
A Faster Distributed Radio Broadcast Primitive
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| On the complexity of vertex-coloring edge-weightings | 2014-03-25 | Paper |
