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.
65 Publications
2024 |Published| Conference Paper | IST-REx-ID: 15008 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Goranci, G., Henzinger, M. H., Räcke, H., Sachdeva, S., & Sricharan, A. R. (2024). Electrical flows for polylogarithmic competitive oblivious routing. In 15th Innovations in Theoretical Computer Science Conference (Vol. 287). Berkeley, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.55
[Published Version]
View
| Files available
| DOI
| arXiv
2024 |Published| Conference Paper | IST-REx-ID: 15007 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alpos, O., Amores-Sesar, I., Cachin, C., & Yeo, M. X. (2024). Eating sandwiches: Modular and lightweight elimination of transaction reordering attacks. In 27th International Conference on Principles of Distributed Systems (Vol. 286). Tokyo, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2023.12
[Published Version]
View
| Files available
| DOI
| arXiv
2024 |Published| Conference Paper | IST-REx-ID: 17144 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kourimska, H., Lieutier, A., & Wintraecken, M. (2024). 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). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.69
[Published Version]
View
| Files available
| DOI
| arXiv
2024 |Published| Conference Paper | IST-REx-ID: 17146 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Edelsbrunner, H., & Pach, J. (2024). Maximum Betti numbers of Čech complexes. In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.53
[Published Version]
View
| Files available
| DOI
| arXiv
2024 |Published| Conference Paper | IST-REx-ID: 17145 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Rote, G., Rüber, M., & Saghafian, M. (2024). Grid peeling of parabolas. In 40th International Symposium on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.76
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 12760 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2023.36
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 14085 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Goranci, G., & Henzinger, M. H. (2023). Efficient data structures for incremental exact and approximate maximum flow. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.69
[Published Version]
View
| Files available
| DOI
2023 |Published| Conference Paper | IST-REx-ID: 14084 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Harris, D. G., & Kolmogorov, V. (2023). Parameter estimation for Gibbs distributions. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.72
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 14083 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Resch, N., Yuan, C., & Zhang, Y. (2023). Zero-rate thresholds and new capacity bounds for list-decoding and list-recovery. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.99
[Published Version]
View
| Files available
| DOI
| arXiv
2023 |Published| Conference Paper | IST-REx-ID: 14485 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement: BatchBoost: Universal batching for concurrent data structures. In 37th International Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35
[Published Version]
View
| Files available
| DOI
2023 |Published| Conference Paper | IST-REx-ID: 14516 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Beaver, D., Kelkar, M., Lewi, K., Nikolaenko, V., Sonnino, A., Chalkias, K., … Roy, A. (2023). STROBE: Streaming Threshold Random Beacons. In 5th Conference on Advances in Financial Technologies (Vol. 282). Princeton, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.AFT.2023.7
[Published Version]
View
| Files available
| DOI
| Download Published Version (ext.)
2022 |Published| Conference Paper | IST-REx-ID: 11184 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alistarh, D.-A., Gelashvili, R., & Rybicki, J. (2022). Fast graphical population protocols. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.14
[Published Version]
View
| Files available
| DOI
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 11183 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Nikabadi, A., & Korhonen, J. (2022). Beyond distributed subgraph detection: Induced subgraphs, multicolored problems and graph parameters. In Q. Bramas, V. Gramoli, & A. Milani (Eds.), 25th International Conference on Principles of Distributed Systems (Vol. 217). Strasbourg, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.OPODIS.2021.15
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 11428 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chambers, E., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (2022). A cautionary tale: Burning the medial axis is unstable. In X. Goaoc & M. Kerber (Eds.), 38th International Symposium on Computational Geometry (Vol. 224, p. 66:1-66:9). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2022.66
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 11812 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Hanauer, K., Henzinger, M. H., & Hua, Q. C. (2022). Fully dynamic four-vertex subgraph counting. In 1st Symposium on Algorithmic Foundations of Dynamic Networks (Vol. 221). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SAND.2022.18
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 |Published| Conference Paper | IST-REx-ID: 12102 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Ahmadi, A., Chatterjee, K., Goharshady, A. K., Meggendorfer, T., Safavi Hemami, R., & Zikelic, D. (2022). Algorithms and hardness results for computing cores of Markov chains. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.29
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12101 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., & Svoboda, J. (2022). Complexity of spatial games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12508 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Henzinger, T. A., Lehtinen, K., & Totzke, P. (2022). History-deterministic timed automata. In 33rd International Conference on Concurrency Theory (Vol. 243, p. 14:1-14:21). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.14
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12509 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Avni, G., & Henzinger, T. A. (2022). An updated survey of bidding games on graphs. In 47th International Symposium on Mathematical Foundations of Computer Science (Vol. 241, p. 3:1-3:6). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2022.3
[Published Version]
View
| Files available
| DOI
2022 |Published| Conference Paper | IST-REx-ID: 12775 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Grover, K., Kretinsky, J., Meggendorfer, T., & Weininger, M. (2022). Anytime guarantees for reachability in uncountable Markov decision processes. In 33rd International Conference on Concurrency Theory (Vol. 243). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2022.11
[Published Version]
View
| Files available
| DOI
| arXiv