From post

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.

 

Другие публикации лиц с тем же именем

Quasipolynomial Set-Based Symbolic Algorithms for Parity Games., , , и . CoRR, (2019)Faster Algorithms for Mean-Payoff Parity Games., , и . MFCS, том 83 из LIPIcs, стр. 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., , , и . ICALP, том 198 из LIPIcs, стр. 124:1-124:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Algorithms and conditional lower bounds for planning problems., , , и . Artif. Intell., (2021)Quasipolynomial Set-Based Symbolic Algorithms for Parity Games., , , и . LPAR, том 57 из EPiC Series in Computing, стр. 233-253. EasyChair, (2018)Near-Linear Time Algorithms for Streett Objectives in Graphs and MDPs., , , и . CONCUR, том 140 из LIPIcs, стр. 7:1-7:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Fully Dynamic k-Center Clustering in Doubling Metrics., , , и . CoRR, (2019)Symbolic Time and Space Tradeoffs for Probabilistic Verification., , , и . LICS, стр. 1-13. IEEE, (2021)Moderne Graphalgorithmen für die formale Verifikation.. Ausgezeichnete Informatikdissertationen, том D-22 из LNI, GI, (2021)