Author of the publication

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes.

, , , and . NeurIPS, page 27184-27195. (2021)

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

Your friends have more friends than you do: identifying influential mobile users through random walks., and . MobiHoc, page 5-14. ACM, (2012)Chernoff-Hoeffding Bounds for Applications with Limited Independence., , and . SIAM J. Discret. Math., 8 (2): 223-250 (1995)Fair Disaster Containment via Graph-Cut Problems., , , , , and . CoRR, (2021)Techniques for Probabilistic Analysis and Randomness-Efficient Computation.. Cornell University, USA, (1993)Improved Approximation Algorithms for the Partial Vertex Cover Problem., and . APPROX, volume 2462 of Lecture Notes in Computer Science, page 161-174. Springer, (2002)Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes., , , and . NeurIPS, page 27184-27195. (2021)Approximation algorithms for stochastic clustering., , , , and . NeurIPS, page 6041-6050. (2018)Assigning Tasks to Workers based on Historical Data: Online Task Assignment with Two-sided Arrivals., , , and . AAMAS, page 318-326. International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA / ACM, (2018)On computing maximal independent sets of hypergraphs in parallel., , , and . SPAA, page 42-50. ACM, (2014)Towards numerical temporal-frequency system modelling of associations between electrocardiogram and ballistocardiogram., , , , and . EMBC, page 394-397. IEEE, (2015)