| Fully Dynamic k-Center Clustering in Low Dimensional Metrics G Goranci, M Henzinger, D Leniowski, C Schulz, A Svozil 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments …, 2021 | 33* | 2021 |
| Near-linear time algorithms for streett objectives in graphs and MDPS K Chatterjee, W Dvorák, M Henzinger, A Svozil arXiv preprint arXiv:1909.05539, 2019 | 11 | 2019 |
| Quasipolynomial set-based symbolic algorithms for parity games K Chatterjee, W Dvořák, M Henzinger, A Svozil arXiv preprint arXiv:1909.04983, 2019 | 11 | 2019 |
| Algorithms and conditional lower bounds for planning problems K Chatterjee, W Dvořák, M Henzinger, A Svozil Artificial Intelligence 297, 103499, 2021 | 7 | 2021 |
| Faster algorithms for mean-payoff parity games K Chatterjee, M Henzinger, A Svozil arXiv preprint arXiv:1706.06139, 2017 | 5 | 2017 |
| Symbolic time and space tradeoffs for probabilistic verification K Chatterjee, W Dvořák, M Henzinger, A Svozil 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021 | 4 | 2021 |
| Faster algorithms for bounded liveness in graphs and game graphs K Chatterjee, M Henzinger, S Kale, A Svozil | 3 | 2021 |
| Leveraging the Power of Graph Algorithms: Efficient Algorithms for Computer-Aided Verification A Svozil arXiv preprint arXiv:2202.02660, 2022 | 2 | 2022 |
| Induction and physical theory formation by Machine Learning A Svozil, K Svozil arXiv preprint arXiv:1609.03862, 2016 | 1 | 2016 |
| Moderne Graphalgorithmen für die formale Verifikation A Svozil D22, 261-270, 2022 | | 2022 |
| Induction and physical theory formation as well as universal computation by machine learning A Svozil, K Svozil Swarm Intelligence, 170-180, 2020 | | 2020 |
| 30th International Conference on Concurrency Theory (CONCUR 2019) WJ Fokkink, RJ van Glabbeek 30th International Conference on Concurrency Theory (CONCUR 2019), 2019 | | 2019 |
| Algorithms and Conditional Lower bounds for Planning Problems W Dvorak, K Chatterjee, M Henzinger, A Svozil International Conference on Automated Planning and Scheduling (ICAPS 2018), 1-14, 2018 | | 2018 |
| Complexity of well-designed SPARQL A Svozil Technische Universität Wien, 2016 | | 2016 |
| Die Wirksamkeit von Graphalgorithmen: Effiziente Algorithmen für die formale Verifikation1 A Svozil | | |
Monika HenzingerProfessor of Computer Science, Institute of Science and Technology Austria (ISTA)Verificeret mail på ist.ac.at