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, Antoine, et al. “On B-Matching and Fully-Dynamic Maximum k-Edge Coloring.” 4th Symposium on Algorithmic Foundations of Dynamic Networks, vol. 330, 4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SAND.2025.4.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20253 |
Henzinger, Thomas A., et al. “Quantitative Language Automata.” 36th International Conference on Concurrency Theory, vol. 348, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.CONCUR.2025.21.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20290 |
Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.30.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20291 |
Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.57.
[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.” 33rd Annual European Symposium on Algorithms, vol. 351, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ESA.2025.2.
[Published Version]
View
| Files available
| DOI
2025 |
Published |
Conference Paper |
IST-REx-ID: 20534 |
Henzinger, Monika, et al. “Efficient Contractions of Dynamic Graphs - with Applications.” 33rd Annual European Symposium on Algorithms, vol. 351, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ESA.2025.36.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20535 |
Dhulipala, Laxman, et al. “Near-Optimal Differentially Private Graph Algorithms via the Multidimensional AboveThreshold Mechanism.” 33rd Annual European Symposium on Algorithms, vol. 351, 91, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi: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.” 19th International Symposium on Algorithms and Data Structures, vol. 349, 47, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.WADS.2025.47.
[Published Version]
View
| Files available
| DOI
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 20587 |
Baig, Mirza Ahad, et al. “Nakamoto Consensus from Multiple Resources.” 7th Conference on Advances in Financial Technologies, vol. 354, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.AFT.2025.16.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 19281 |
Resch, Nicolas, et al. “Tight Bounds on List-Decodable and List-Recoverable Zero-Rate Codes.” 16th Innovations in Theoretical Computer Science Conference, vol. 325, 82, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ITCS.2025.82.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2025 |
Published |
Conference Paper |
IST-REx-ID: 21412 |
Chatterjee, Krishnendu, et al. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” 39th International Symposium on Distributed Computing, vol. 356, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.DISC.2025.23.
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18066 |
Avni, Guy, et al. “Bidding Games with Charging.” 35th International Conference on Concurrency Theory, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.8.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18067 |
Boker, Udi, et al. “History-Determinism vs Fair Simulation.” 35th International Conference on Concurrency Theory, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.12.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18068 |
Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” 35th International Conference on Concurrency Theory, vol. 311, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.29.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18156 |
Henzinger, Monika, et al. “Private Counting of Distinct Elements in the Turnstile Model and Extensions.” International Conference on Approximation Algorithms for Combinatorial Optimization Problems , vol. 317, 40, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.APPROX/RANDOM.2024.40.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18175 |
Maj, Petr, et al. “The Fault in Our Stars: Designing Reproducible Large-Scale Code Analysis Experiments.” 38th European Conference on Object-Oriented Programming, vol. 313, 27, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ECOOP.2024.27.
[Published Version]
View
| Files available
| DOI
| WoS
2024 |
Published |
Conference Paper |
IST-REx-ID: 18308 |
La Tour, Max Dupré, et al. “Fully Dynamic K-Means Coreset in near-Optimal Update Time.” 32nd Annual European Symposium on Algorithms, vol. 308, 100, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.ESA.2024.100.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18309 |
Hu, Bingbing, et al. “Connectivity Oracles for Predictable Vertex Failures.” 32nd Annual European Symposium on Algorithms, vol. 308, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi: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, Sebastiano, et al. “The Euclidean MST-Ratio for Bi-Colored Lattices.” 32nd International Symposium on Graph Drawing and Network Visualization, vol. 320, 3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.GD.2024.3.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2024 |
Published |
Conference Paper |
IST-REx-ID: 18557 |
El-Hayek, Antoine, et al. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” 38th International Symposium on Distributed Computing, vol. 319, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.DISC.2024.21.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv