Author of the publication

Infinite-Duration Poorman-Bidding Games.

, , and . WINE, volume 11316 of Lecture Notes in Computer Science, page 21-36. Springer, (2018)

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.

 

Other publications of authors with the same name

The Big Match in Small Space., , and . CoRR, (2016)The Big Match in Small Space - (Extended Abstract)., , and . SAGT, volume 9928 of Lecture Notes in Computer Science, page 64-76. Springer, (2016)Infinite-Duration Poorman-Bidding Games., , and . WINE, volume 11316 of Lecture Notes in Computer Science, page 21-36. Springer, (2018)A short proof of correctness of the quasi-polynomial time algorithm for parity games., and . CoRR, (2017)Edit distance for timed automata., , and . HSCC, page 303-312. ACM, (2014)Optimal and Perfectly Parallel Algorithms for On-demand Data-Flow Analysis., , , and . ESOP, volume 12075 of Lecture Notes in Computer Science, page 112-140. Springer, (2020)Complexity of Spatial Games., , , and . FSTTCS, volume 250 of LIPIcs, page 11:1-11:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)The Big Match with a Clock and a Bit of Memory., , and . EC, page 149-150. ACM, (2018)Qualitative analysis of concurrent mean-payoff games., and . Inf. Comput., (2015)Edit Distance for Pushdown Automata., , , and . ICALP (2), volume 9135 of Lecture Notes in Computer Science, page 121-133. Springer, (2015)