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. 4th Symposium on Algorithmic Foundations of Dynamic Networks. SAND: Symposium on Algorithmic Foundations of Dynamic Networks, LIPIcs, vol. 330, 4.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20253 |
Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2025. Quantitative language automata. 36th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 348, 21.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20290 |
Brice L, Henzinger TA, Thejaswini KS. 2025. Finding equilibria: Simpler for pessimists, simplest for optimists. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 30.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20291 |
Henzinger TA, Prakash A, Thejaswini KS. 2025. Resolving nondeterminism with randomness. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 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. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 351, 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. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms vol. 351, 36.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20535 |
Dhulipala L, Henzinger M, Li GZ, Liu QC, Sricharan AR, Zhu L. 2025. Near-optimal differentially private graph algorithms via the Multidimensional AboveThreshold Mechanism. 33rd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 351, 91.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20536 |
Safavi Hemami R, Seybold MP. 2025. B-Treaps revised: Write efficient randomized block search trees with high load. 19th International Symposium on Algorithms and Data Structures. WADS: Algorithms and Data Structures Symposium, LIPIcs, vol. 349, 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. 16th Innovations in Theoretical Computer Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs, vol. 325, 82.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21412 |
Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. 2025. Boosting payment channel network liquidity with topology optimization and transaction selection. 39th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 356, 23.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20587 |
Baig MA, Günther CU, Pietrzak KZ. 2025. Nakamoto consensus from multiple resources. 7th Conference on Advances in Financial Technologies. AFT: Conference on Advances in Financial Technologies, LIPIcs, vol. 354, 16.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18066 |
Avni G, Goharshady EK, Henzinger TA, Mallik K. 2024. Bidding games with charging. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 8.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18067 |
Boker U, Henzinger TA, Lehtinen K, Prakash A. 2024. History-determinism vs fair simulation. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 12.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18068 |
Henzinger TA, Mazzocchi NA, Sarac NE. 2024. Strategic dominance: A new preorder for nondeterministic processes. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 29.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18156 |
Henzinger M, Sricharan AR, Steiner TA. 2024. Private counting of distinct elements in the turnstile model and extensions. International Conference on Approximation Algorithms for Combinatorial Optimization Problems . APPROX: Conference on Approximation Algorithms for Combinatorial Optimization Problems, LIPIcs, vol. 317, 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. 38th European Conference on Object-Oriented Programming. ECOOP: European Conference on Object-Oriented Programming, LIPIcs, vol. 313, 27.
[Published Version]
View
| Files available
| DOI
| WoS
2024 |
Published |
Conference Paper |
IST-REx-ID: 18308 |
La Tour MD, Henzinger M, Saulpic D. 2024. Fully dynamic k-means coreset in near-optimal update time. 32nd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 308, 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. 32nd Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 308, 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. 32nd International Symposium on Graph Drawing and Network Visualization. GD: Graph Drawing and Network Visualization, LIPIcs, vol. 320, 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. 38th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 319, 21.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv