Alexander Svozil
Title
Cited by
Cited by
Year
Quasipolynomial set-based symbolic algorithms for parity games
K Chatterjee, W Dvořák, M Henzinger, A Svozil
arXiv preprint arXiv:1909.04983, 2019
72019
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
52019
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
4*2021
Algorithms and conditional lower bounds for planning problems
K Chatterjee, W Dvořák, M Henzinger, A Svozil
Artificial Intelligence 297, 103499, 2021
12021
Faster algorithms for mean-payoff parity games
K Chatterjee, M Henzinger, A Svozil
arXiv preprint arXiv:1706.06139, 2017
12017
Induction and physical theory formation by Machine Learning
A Svozil, K Svozil
arXiv preprint arXiv:1609.03862, 2016
12016
Faster Algorithms for Bounded Liveness in Graphs and Game Graphs
K Chatterjee, M Henzinger, S Kale, A Svozil
2021
Symbolic Time and Space Tradeoffs for Probabilistic Verification
K Chatterjee, W Dvořák, M Henzinger, A Svozil
arXiv preprint arXiv:2104.07466, 2021
2021
Induction and physical theory formation as well as universal computation by machine learning
A Svozil, K Svozil
Swarm Intelligence, 170-180, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–9