Please note that IST 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.
2018 | Conference Paper | IST-REx-ID: 310 |
Chatterjee K, Dvorák W, Henzinger M, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.View | DOI | Download Preprint (ext.) | arXiv