| Publication | Date of Publication | Type |
|---|
Approximating Pandora's box with correlations
| 2025-01-14 | Paper |
Graph connectivity with noisy queries
| 2024-12-03 | Paper |
Buy-many mechanisms for many unit-demand buyers
| 2024-09-20 | Paper |
Fast and simple modular subset sum
| 2024-05-14 | Paper |
A strongly polynomial algorithm for approximate Forster transforms and its application to halfspace learning
| 2024-05-08 | Paper |
Learning general halfspaces with general Massart noise under the Gaussian distribution
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Pricing ordered items
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Efficiently learning halfspaces with Tsybakov noise
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 2023-11-14 | Paper |
Efficient parameter estimation of truncated Boolean product distributions
Algorithmica | 2022-08-03 | Paper |
scientific article; zbMATH DE number 7561512 (Why is no real title available?)
| 2022-07-21 | Paper |
Buy-many mechanisms are not much better than item pricing
Games and Economic Behavior | 2022-07-15 | Paper |
A Statistical Taylor Theorem and Extrapolation of Truncated Densities
| 2021-06-30 | Paper |
Optimal Private Median Estimation under Minimal Distributional Assumptions
| 2020-11-11 | Paper |
Efficient Parameter Estimation of Truncated Boolean Product Distributions
| 2020-07-05 | Paper |
Combinatorial assortment optimization
| 2020-06-18 | Paper |
Fast modular subset sum using linear sketching
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
\textsc{Anaconda}: a non-adaptive conditional sampling algorithm for distribution testing
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
A converse to Banach's fixed point theorem and its CLS-completeness
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
The complexity of optimal mechanism design
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
Strong Duality for a Multiple-Good Monopolist
Econometrica | 2019-02-01 | Paper |
Faster sublinear algorithms using conditional sampling
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Tight hardness results for maximum weight rectangles
| 2017-12-19 | Paper |
A size-free CLT for Poisson multinomials and its applications
Proceedings of the forty-eighth annual ACM symposium on Theory of Computing | 2017-09-29 | Paper |
Anonymous auctions maximizing revenue
Web and Internet Economics | 2017-02-10 | Paper |
Efficient money burning in general domains
Theory of Computing Systems | 2017-02-01 | Paper |
Strategyproof facility location for concave cost functions
Algorithmica | 2016-11-01 | Paper |
Efficient money burning in general domains
Algorithmic Game Theory | 2015-11-04 | Paper |
On the Structure, Covering, and Learning of Poisson Multinomial Distributions
| 2015-04-30 | Paper |
On the power of deterministic mechanisms for facility location games
Automata, Languages, and Programming | 2013-08-06 | Paper |
Winner-imposing strategyproof mechanisms for multiple facility location games
Theoretical Computer Science | 2013-03-04 | Paper |
