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.
1 Publication
2024 | Published | Conference Paper | IST-REx-ID: 18955 | 
Casares, Antonio, Marcin Pilipczuk, Michał Pilipczuk, Uéverton S. Souza, and K. S. Thejaswini. “Simple and Tight Complexity Lower Bounds for Solving Rabin Games.” In 2024 Symposium on Simplicity in Algorithms, 160–67. Society for Industrial and Applied Mathematics, 2024. https://doi.org/10.1137/1.9781611977936.16.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv