Author of the publication

(Fractional) online stochastic matching via fine-grained offline statistics.

, , and . STOC, page 77-90. ACM, (2022)

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

Weighted Pseudorandom Generators via Inverse Analysis of Random Walks and Shortcutting., , , , and . FOCS, page 1224-1239. IEEE, (2023)Simple & Optimal Quantile Sketch: Combining Greenwald-Khanna with Khanna-Greenwald., , , and . Proc. ACM Manag. Data, 2 (2): 109 (2024)New PRGs for Unbounded-Width/Adaptive-Order Read-Once Branching Programs., , , and . ICALP, volume 261 of LIPIcs, page 39:1-39:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Oblivious Online Contention Resolution Schemes., , , , , , and . SOSA, page 268-278. SIAM, (2022)Sample-Based Matroid Prophet Inequalities., , , , , and . CoRR, (2024)Optimal quantile estimation: beyond the comparison model., , and . Electron. Colloquium Comput. Complex., (2024)Near-Optimal Algorithm for Constructing Greedy Consensus Tree.. ICALP, volume 168 of LIPIcs, page 105:1-105:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Fast Modular Subset Sum using Linear Sketching., , , , and . SODA, page 58-69. SIAM, (2019)Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions., , , and . SODA, page 1661-1678. SIAM, (2022)Faster Matrix Multiplication via Asymmetric Hashing., , and . FOCS, page 2129-2138. IEEE, (2023)