( en | de | ru )

 

Disambiguation of "Jurdzinski, Marcin"

Author of the publication

copydeleteadd this publication to your clipboard
Alternating Weak Automata from Universal Trees.

, , and . CONCUR, volume 140 of LIPIcs, page 18:1-18:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)

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.

Gerald Jurdzinski

Marcin Wlodarski

Marcin Grzegorzek

Marcin Å0yszkiewicz

Marcin Tysiac

 

Other publications of authors with the same name

Quantitative stochastic parity games., , and . SODA, page 121-130. SIAM, (2004)Zero-Sum Game Techniques for Approximate Nash Equilibria., , and . AAMAS, page 1514-1516. ACM, (2017)When are emptiness and containment decidable for probabilistic automata?, , , , , and . J. Comput. Syst. Sci., (2021)Algorithms for solving parity games.. Lectures in Game Theory for Computer Scientists, Cambridge University Press, (2011)Interface Compatibility Checking for Software Modules., , , , and . CAV, volume 2404 of Lecture Notes in Computer Science, page 428-441. Springer, (2002)Model Checking Probabilistic Timed Automata with One or Two Clocks., , and . Logical Methods in Computer Science, (2008)Trading Probability for Fairness., , and . CSL, volume 2471 of Lecture Notes in Computer Science, page 292-305. Springer, (2002)Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games., , , , , and . SODA, page 2333-2349. SIAM, (2019)A Technique to Speed up Symmetric Attractor-Based Algorithms for Parity Games., , and . FSTTCS, volume 250 of LIPIcs, page 44:1-44:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Hereditary History Preserving Bisimilarity Is Undecidable., and . STACS, volume 1770 of Lecture Notes in Computer Science, page 358-369. Springer, (2000)