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.
6 Publications
2023 | Published | Conference Paper | IST-REx-ID: 13120 |

Dvorak, M., & Blanchette, J. (2023). Closure properties of general grammars - formally verified. In 14th International Conference on Interactive Theorem Proving (Vol. 268). Bialystok, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITP.2023.15
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13221 |

Boker, U., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2023). Safety and liveness of quantitative automata. In 34th International Conference on Concurrency Theory (Vol. 279). Antwerp, Belgium: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2023.17
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 13292 |

Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2023). Regular methods for operator precedence languages. In 50th International Colloquium on Automata, Languages, and Programming (Vol. 261, p. 129:1--129:20). Paderborn, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2023.129
[Published Version]
View
| Files available
| DOI
| arXiv
2023 | Published | Conference Paper | IST-REx-ID: 14417 |

Baier, C., Chatterjee, K., Meggendorfer, T., & Piribauer, J. (2023). Entropic risk for turn-based stochastic games. In 48th International Symposium on Mathematical Foundations of Computer Science (Vol. 272). Bordeaux, France: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2023.15
[Published Version]
View
| Files available
| DOI
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 11808 |

Hanauer, K., Henzinger, M. H., & Schulz, C. (2022). Recent advances in fully dynamic graph algorithms. 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.1
[Published Version]
View
| DOI
| Download Published Version (ext.)
| arXiv
2022 | Published | Conference Paper | IST-REx-ID: 12182 |

Pacut, M., Parham, M., Rybicki, J., Schmid, S., Suomela, J., & Tereshchenko, A. (2022). Brief announcement: Temporal locality in online algorithms. In 36th International Symposium on Distributed Computing (Vol. 246). Augusta, GA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2022.52
[Published Version]
View
| Files available
| DOI