( en | de | ru )

 

Disambiguation of "Svozil, Alexander"

Author of the publication

copydeleteadd this publication to your clipboard
Faster Algorithms for Mean-Payoff Parity Games.

, , and . MFCS, volume 83 of LIPIcs, page 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Alexander

Alexander Stadler

Messtechnische Bestimmung und Simulation der Kernverluste in weichmagnetischen Materialien. Uni Erlangen-Nürnberg, (2009)

Alexander Auch

A phylogenetic potpourri: computational methods for analysing genome scale data. Uni Tübingen, (2010)

Alexander Blecken

A reference task model for supply chain processes of humanitarian organisations. Uni Paderborn, (2009)

Alexander Gocht

Methods in economic farm modelling. Uni Bonn, (2009)
 

Other publications of authors with the same name

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games., , , and . CoRR, (2019)Faster Algorithms for Mean-Payoff Parity Games., , and . MFCS, volume 83 of LIPIcs, page 39:1-39:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Leveraging the Power of Graph Algorithms: Efficient Algorithms for Computer-Aided Verification.. CoRR, (2022)Faster Algorithms for Bounded Liveness in Graphs and Game Graphs., , , and . ICALP, volume 198 of LIPIcs, page 124:1-124:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Quasipolynomial Set-Based Symbolic Algorithms for Parity Games., , , and . LPAR, volume 57 of EPiC Series in Computing, page 233-253. EasyChair, (2018)Algorithms and conditional lower bounds for planning problems., , , and . Artif. Intell., (2021)Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs., , , and . CONCUR, volume 140 of LIPIcs, page 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Fully Dynamic k-Center Clustering in Doubling Metrics., , , and . CoRR, (2019)Symbolic Time and Space Tradeoffs for Probabilistic Verification., , , and . LICS, page 1-13. IEEE, (2021)Moderne Graphalgorithmen für die formale Verifikation.. Ausgezeichnete Informatikdissertationen, volume D-22 of LNI, GI, (2021)