Author of the publication

Faster Monte-Carlo Algorithms for Fixation Probability of the Moran Process on Undirected Graphs.

, , and . MFCS, volume 83 of LIPIcs, page 61:1-61:13. 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.

 

Other publications of authors with the same name

Patience of Matrix Games, , , and . CoRR, (2012)The Complexity of Interior Point Methods for Solving Discounted Turn-Based Stochastic Games., and . CiE, volume 7921 of Lecture Notes in Computer Science, page 252-262. Springer, (2013)Robust Draws in Balanced Knockout Tournaments., , and . IJCAI, page 172-179. IJCAI/AAAI Press, (2016)Faster Algorithms for Dynamic Algebraic Queries in Basic RSMs with Constant Treewidth., , , , and . ACM Trans. Program. Lang. Syst., 41 (4): 23:1-23:46 (2019)Algorithms for algebraic path properties in concurrent systems of constant treewidth components., , , and . POPL, page 733-747. ACM, (2016)The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games., and . SODA, page 1018-1029. SIAM, (2015)Ergodic Mean-Payoff Games for the Analysis of Attacks in Crypto-Currencies., , , and . CONCUR, volume 118 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)One-Clock Priced Timed Games are PSPACE-hard., , and . LICS, page 397-409. ACM, (2020)The Big Match with a Clock and a Bit of Memory., , and . EC, page 149-150. ACM, (2018)The Value 1 Problem Under Finite-memory Strategies for Concurrent Mean-payoff Games., and . CoRR, (2014)