Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
112 Publications
2025 | Published | Conference Paper | IST-REx-ID: 20290 | 
Brice, Léonard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.30.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20291 |
Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.57.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19281 |
Resch, Nicolas, Chen Yuan, and Yihan Zhang. “Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.” In 16th Innovations in Theoretical Computer Science Conference, Vol. 325. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITCS.2025.82.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 19858 |
El-Hayek, Antoine, Kathrin Hanauer, and Monika Henzinger. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” In 4th Symposium on Algorithmic Foundations of Dynamic Networks, Vol. 330. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SAND.2025.4.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20535 |
Dhulipala, Laxman, Monika Henzinger, George Z. Li, Quanquan C. Liu, A. R. Sricharan, and Leqi Zhu. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.91.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20536 |
Safavi Hemami, Roodabeh, and Martin P. Seybold. “B-Treaps Revised: Write Efficient Randomized Block Search Trees with High Load.” In 19th International Symposium on Algorithms and Data Structures, Vol. 349. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.WADS.2025.47.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20534 |
Henzinger, Monika, Evangelos Kosinas, Robin Münk, and Harald Räcke. “Efficient Contractions of Dynamic Graphs - with Applications.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.36.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20533 |
Henzinger, Monika, and Roodabeh Safavi Hemami. “Securing Dynamic Data: A Primer on Differentially Private Data Structures.” In 33rd Annual European Symposium on Algorithms, Vol. 351. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ESA.2025.2.
[Published Version]
View
| Files available
| DOI
2025 | Published | Conference Paper | IST-REx-ID: 20587 |
Baig, Mirza Ahad, Christoph Ullrich Günther, and Krzysztof Z Pietrzak. “Nakamoto Consensus from Multiple Resources.” In 7th Conference on Advances in Financial Technologies, Vol. 354. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.AFT.2025.16.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2025 | Published | Conference Paper | IST-REx-ID: 20253 |
Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Language Automata.” In 36th International Conference on Concurrency Theory, Vol. 348. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17145 |
Rote, Günter, Moritz Rüber, and Morteza Saghafian. “Grid Peeling of Parabolas.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.76.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17144 |
Kourimska, Hana, André Lieutier, and Mathijs Wintraecken. “The Medial Axis of Any Closed Bounded Set Is Lipschitz Stable with Respect to the Hausdorff Distance Under Ambient Diffeomorphisms.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.69.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15008 |
Goranci, Gramoz, Monika Henzinger, Harald Räcke, Sushant Sachdeva, and A. R. Sricharan. “Electrical Flows for Polylogarithmic Competitive Oblivious Routing.” In 15th Innovations in Theoretical Computer Science Conference, Vol. 287. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ITCS.2024.55.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17146 |
Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” In 40th International Symposium on Computational Geometry, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.53.
[Published Version]
View
| Files available
| DOI
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17099 |
Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Concurrent Stochastic Games with Stateful-Discounted and Parity Objectives: Complexity and Algorithms.” In 44th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Vol. 323. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSTTCS.2024.5.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15006 |
Hirvonen, Juho, Laura Schmid, Krishnendu Chatterjee, and Stefan Schmid. “On the Convergence Time in Graphical Games: A Locality-Sensitive Approach.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.11.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 15007 |
Alpos, Orestis, Ignacio Amores-Sesar, Christian Cachin, and Michelle X Yeo. “Eating Sandwiches: Modular and Lightweight Elimination of Transaction Reordering Attacks.” In 27th International Conference on Principles of Distributed Systems, Vol. 286. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.OPODIS.2023.12.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 18066 |
Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik. “Bidding Games with Charging.” In 35th International Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.8.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 | Published | Conference Paper | IST-REx-ID: 17327 |
Cano, Filip, Thomas A Henzinger, Bettina Könighofer, Konstantin Kueffner, and Kaushik Mallik. “Abstraction-Based Decision Making for Statistical Properties.” In 9th International Conference on Formal Structures for Computation and Deduction, Vol. 299. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.FSCD.2024.2.
[Published Version]
View
| Files available
| DOI
| WoS
2024 | Published | Conference Paper | IST-REx-ID: 18156 |
Henzinger, Monika, A. R. Sricharan, and Teresa Anna Steiner. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” In International Conference on Approximation Algorithms for Combinatorial Optimization Problems , Vol. 317. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv