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.
113 Publications
2025 |
Published |
Conference Paper |
IST-REx-ID: 19858 |
El-Hayek, A., Hanauer, K., & Henzinger, M. (2025). On b-matching and fully-dynamic maximum k-edge coloring. In 4th Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 330). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2025.4
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20253 |
Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2025). Quantitative language automata. In 36th International Conference on Concurrency Theory (Vol. 348). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20290 |
Brice, L., Henzinger, T. A., & Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, T. A., Prakash, A., & Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.57
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20533 |
Henzinger, M., & Safavi Hemami, R. (2025). Securing dynamic data: A primer on differentially private data structures. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2025.2
[Published Version]
View
| Files available
| DOI
2025 |
Published |
Conference Paper |
IST-REx-ID: 20534 |
Henzinger, M., Kosinas, E., Münk, R., & Räcke, H. (2025). Efficient contractions of dynamic graphs - with applications. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2025.36
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20535 |
Dhulipala, L., Henzinger, M., Li, G. Z., Liu, Q. C., Sricharan, A. R., & Zhu, L. (2025). Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. In 33rd Annual European Symposium on Algorithms (Vol. 351). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. 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, R., & Seybold, M. P. (2025). B-Treaps revised: Write efficient randomized block search trees with high load. In 19th International Symposium on Algorithms and Data Structures (Vol. 349). Toronto, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.WADS.2025.47
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19281 |
Resch, N., Yuan, C., & Zhang, Y. (2025). Tight bounds on list-decodable and list-recoverable zero-rate codes. In 16th Innovations in Theoretical Computer Science Conference (Vol. 325). New York, NY, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2025.82
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21412 |
Chatterjee, K., Křišťan, J. M., Schmid, S., Svoboda, J., & Yeo, M. X. (2025). Boosting payment channel network liquidity with topology optimization and transaction selection. In 39th International Symposium on Distributed Computing (Vol. 356). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2025.23
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20587 |
Baig, M. A., Günther, C. U., & Pietrzak, K. Z. (2025). Nakamoto consensus from multiple resources. In 7th Conference on Advances in Financial Technologies (Vol. 354). Pittsburgh, PA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.AFT.2025.16
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18066 |
Avni, G., Goharshady, E. K., Henzinger, T. A., & Mallik, K. (2024). Bidding games with charging. In 35th International Conference on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.8
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18067 |
Boker, U., Henzinger, T. A., Lehtinen, K., & Prakash, A. (2024). History-determinism vs fair simulation. In 35th International Conference on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.12
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18068 |
Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2024). Strategic dominance: A new preorder for nondeterministic processes. In 35th International Conference on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18156 |
Henzinger, M., Sricharan, A. R., & Steiner, T. A. (2024). Private counting of distinct elements in the turnstile model and extensions. In International Conference on Approximation Algorithms for Combinatorial Optimization Problems (Vol. 317). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.40
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18175 |
Maj, P., Muroya Lei, S., Siek, K., Di Grazia, L., & Vitek, J. (2024). The fault in our stars: Designing reproducible large-scale code analysis experiments. In 38th European Conference on Object-Oriented Programming (Vol. 313). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ECOOP.2024.27
[Published Version]
View
| Files available
| DOI
| WoS
2024 |
Published |
Conference Paper |
IST-REx-ID: 18308 |
La Tour, M. D., Henzinger, M., & Saulpic, D. (2024). Fully dynamic k-means coreset in near-optimal update time. In 32nd Annual European Symposium on Algorithms (Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2024.100
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18309 |
Hu, B., Kosinas, E., & Polak, A. (2024). Connectivity oracles for predictable vertex failures. In 32nd Annual European Symposium on Algorithms (Vol. 308). London, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2024.72
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18556 |
Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., & Saghafian, M. (2024). The Euclidean MST-ratio for bi-colored lattices. In 32nd International Symposium on Graph Drawing and Network Visualization (Vol. 320). Vienna, Austria: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.GD.2024.3
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18557 |
El-Hayek, A., Henzinger, M., & Schmid, S. (2024). Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In 38th International Symposium on Distributed Computing (Vol. 319). Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2024.21
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv