From post

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.

 

Другие публикации лиц с тем же именем

Separation in Correlation-Robust Monopolist Problem with Budget., и . SODA, стр. 2069-2080. SIAM, (2018)Towards Optimal Algorithms for Prediction with Expert Advice., , и . SODA, стр. 528-547. SIAM, (2016)Time Optimal d-List Colouring of a Graph.. CSR, том 6072 из Lecture Notes in Computer Science, стр. 156-168. Springer, (2010)Concentration bounds for almost k-wise independence with applications to non-uniform security., , , и . SODA, стр. 2404-2423. SIAM, (2021)Tight Lower Bounds for Multiplicative Weights Algorithmic Families., , и . ICALP, том 80 из LIPIcs, стр. 48:1-48:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Bayesian and Randomized Clock Auctions., , , и . EC, стр. 820-845. ACM, (2022)Secretary Matching with General Arrivals., , , и . CoRR, (2020)Lookahead Auctions with Pooling., , , и . SAGT, том 13584 из Lecture Notes in Computer Science, стр. 60-77. Springer, (2022)Correlation-Robust Analysis of Single Item Auction., , , и . SODA, стр. 193-208. SIAM, (2019)Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching., , , и . WINE, том 13112 из Lecture Notes in Computer Science, стр. 131-148. Springer, (2021)