Author of the publication

Lossless Online Rounding for Online Bipartite Matching (Despite its Impossibility).

, , and . SODA, page 2030-2068. SIAM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Lower and Upper Bounds on Obtaining History Independence., and . CRYPTO, volume 2729 of Lecture Notes in Computer Science, page 445-462. Springer, (2003)Online Primal-Dual Algorithms for Covering and Packing., and . Math. Oper. Res., 34 (2): 270-286 (2009)Deterministic Algorithms for Submodular Maximization Problems., and . SODA, page 392-403. SIAM, (2016)Online Submodular Maximization with Preemption., , and . SODA, page 1202-1216. SIAM, (2015)Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue., , and . ESA, volume 4698 of Lecture Notes in Computer Science, page 253-264. Springer, (2007)Online k-Taxi via Double Coverage and Time-Reverse Primal-Dual., , and . CoRR, (2020)Dynamic Power Allocation Under Arbitrary Varying Channels - The Multi-User Case., , , , and . INFOCOM, page 2402-2410. IEEE, (2010)Online Submodular Maximization: Beating 1/2 Made Simple., , , and . IPCO, volume 11480 of Lecture Notes in Computer Science, page 101-114. Springer, (2019)Metrical Task Systems and the k-Server Problem on HSTs., , and . ICALP (1), volume 6198 of Lecture Notes in Computer Science, page 287-298. Springer, (2010)Dynamic Power Allocation Under Arbitrary Varying Channels - An Online Approach., , , , and . INFOCOM, page 145-153. IEEE, (2009)