| Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs P Dutting, M Feldman, T Kesselheim, B Lucier SIAM Journal on Computing 49 (3), 540-582, 2020 | 225 | 2020 |
| An optimal online algorithm for weighted bipartite matching and extensions to combinatorial auctions T Kesselheim, K Radke, A Tönnis, B Vöcking European symposium on algorithms, 589-600, 2013 | 213 | 2013 |
| Primal beats dual on online packing LPs in the random-order model T Kesselheim, A Tönnis, K Radke, B Vöcking Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 207 | 2014 |
| A constant-factor approximation for wireless capacity maximization with power control in the SINR model T Kesselheim 22nd ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, 1549-1559, 2010 | 176 | 2010 |
| Prophet secretary for combinatorial auctions and matroids S Ehsani, MT Hajiaghayi, T Kesselheim, S Singla Proceedings of the twenty-ninth annual acm-siam symposium on discrete …, 2018 | 160 | 2018 |
| Distributed contention resolution in wireless networks T Kesselheim, B Vöcking Distributed Computing, 163-178, 2010 | 131 | 2010 |
| Oblivious interference scheduling A Fanghänel, T Kesselheim, H Räcke, B Vöcking Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009 | 105 | 2009 |
| Combinatorial contracts P Dütting, T Ezra, M Feldman, T Kesselheim SIAM Journal on Computing 54 (6), 1427-1455, 2025 | 91 | 2025 |
| Improved algorithms for latency minimization in wireless networks A Fanghänel, T Kesselheim, B Vöcking Automata, Languages and Programming, 447-458, 2009 | 89 | 2009 |
| Approximation algorithms for secondary spectrum auctions M Hoefer, T Kesselheim, B Vöcking Proceedings of the 23rd ACM symposium on Parallelism in algorithms and …, 2011 | 84 | 2011 |
| An o (log log m) prophet inequality for subadditive combinatorial auctions P Dütting, T Kesselheim, B Lucier ACM SIGecom Exchanges 18 (2), 32-37, 2020 | 83 | 2020 |
| Multi-agent contracts P Dütting, T Ezra, M Feldman, T Kesselheim Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1311-1324, 2023 | 79 | 2023 |
| Online independent set beyond the worst-case: Secretaries, prophets, and periods O Göbel, M Hoefer, T Kesselheim, T Schleiden, B Vöcking International Colloquium on Automata, Languages, and Programming, 508-519, 2014 | 62 | 2014 |
| Scheduling in wireless networks with Rayleigh-fading interference J Dams, M Hoefer, T Kesselheim Proceedings of the 24th ACM symposium on Parallelism in algorithms and …, 2012 | 59 | 2012 |
| Secretary Problems with Non-Uniform Arrival Order T Kesselheim, R Kleinberg, R Niazadeh Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, 2015 | 56 | 2015 |
| Dynamic packet scheduling in wireless networks T Kesselheim Proceedings of the 2012 ACM symposium on Principles of distributed computing …, 2012 | 49 | 2012 |
| Online learning with vector costs and bandits with knapsacks T Kesselheim, S Singla Conference on Learning Theory, 2286-2305, 2020 | 45 | 2020 |
| Approximation algorithms for wireless link scheduling with flexible data rates T Kesselheim European Symposium on Algorithms, 659-670, 2012 | 42 | 2012 |
| Improved truthful mechanisms for subadditive combinatorial auctions: Breaking the logarithmic barrier S Assadi, T Kesselheim, S Singla Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA …, 2021 | 41 | 2021 |
| Posted pricing and prophet inequalities with inaccurate priors P Dütting, T Kesselheim Proceedings of the 2019 ACM Conference on Economics and Computation, 111-129, 2019 | 39 | 2019 |
Paul David DüttingResearch Scientist at GoogleVerified email at google.com
