Author of the publication

Subset Sum in Time 2n/2 / poly(n).

, , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 39:1-39:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (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

Tight Revenue Gaps among Simple Mechanisms., , , and . CoRR, (2018)First Price Auction is 1-1/e2 Efficient., and . J. ACM, 70 (5): 36:1-36:86 (October 2023)Subset Sum in Time 2n/2 / poly(n)., , , and . APPROX/RANDOM, volume 275 of LIPIcs, page 39:1-39:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Approximability of Simple Mechanisms for MHR Distributions., , and . WINE, volume 11920 of Lecture Notes in Computer Science, page 228-240. Springer, (2019)Tight revenue gaps among simple and optimal mechanisms., , , , and . SIGecom Exch., 17 (2): 54-61 (2019)The Price of Stability for First Price Auction., and . CoRR, (2022)The Price of Stability for First Price Auction., and . SODA, page 332-352. SIAM, (2023)Tight Revenue Gaps among Multi-Unit Mechanisms., , , and . EC, page 654-673. ACM, (2021)Learning Reserve Prices in Second-Price Auctions., , and . CoRR, (2019)Tight Revenue Gaps Among Simple Mechanisms., , , and . SIAM J. Comput., 49 (5): 927-958 (2020)