Solving parity games in practice O Friedmann, M Lange International Symposium on Automated Technology for Verification and …, 2009 | 107 | 2009 |

An exponential lower bound for the parity game strategy improvement algorithm as we know it O Friedmann 2009 24th Annual IEEE Symposium on Logic In Computer Science, 145-156, 2009 | 104 | 2009 |

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm O Friedmann, TD Hansen, U Zwick Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011 | 72 | 2011 |

A subexponential lower bound for Zadeh’s pivoting rule for solving linear programs and games O Friedmann International Conference on Integer Programming and Combinatorial …, 2011 | 55 | 2011 |

A Decision Procedure for CTL^{*} Based on Tableaux and AutomataO Friedmann, M Latte, M Lange International Joint Conference on Automated Reasoning, 331-345, 2010 | 36 | 2010 |

An exponential lower bound for the latest deterministic strategy iteration algorithms O Friedmann arXiv preprint arXiv:1106.0778, 2011 | 34 | 2011 |

A solver for modal fixpoint logics O Friedmann, M Lange Electronic Notes in Theoretical Computer Science 262, 99-111, 2010 | 34 | 2010 |

The PGSolver collection of parity game solvers O Friedmann, M Lange University of Munich, 4-6, 2009 | 31 | 2009 |

Recursive algorithm for parity games requires exponential time O Friedmann RAIRO-Theoretical Informatics and Applications 45 (4), 449-457, 2011 | 30 | 2011 |

A subexponential lower bound for the random facet algorithm for parity games O Friedmann, TD Hansen, U Zwick Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011 | 23 | 2011 |

On guarded transformation in the modal μ-calculus F Bruse, O Friedmann, M Lange Logic Journal of the IGPL 23 (2), 194-216, 2015 | 20 | 2015 |

Exponential lower bounds for solving infinitary payoff games and linear programs O Friedmann lmu, 2011 | 15 | 2011 |

The Modal *μ*-Calculus Caught Off GuardO Friedmann, M Lange International Conference on Automated Reasoning with Analytic Tableaux and …, 2011 | 14 | 2011 |

An exponential lower bound for Cunningham’s rule D Avis, O Friedmann Mathematical Programming 161 (1-2), 271-305, 2017 | 11 | 2017 |

Local strategy improvement for parity game solving O Friedmann, M Lange arXiv preprint arXiv:1006.1409, 2010 | 10 | 2010 |

Deciding the unguarded modal-calculus O Friedmann, M Lange Journal of Applied Non-Classical Logics 23 (4), 353-371, 2013 | 9 | 2013 |

The stevens-stirling-algorithm for solving parity games locally requires exponential time O Friedmann International Journal of Foundations of Computer Science 21 (03), 277-287, 2010 | 9 | 2010 |

Ramsey-based analysis of parity automata O Friedmann, M Lange International Conference on Tools and Algorithms for the Construction and …, 2012 | 8 | 2012 |

Random-Facet and Random-Bland require subexponential time even for shortest paths O Friedmann, TD Hansen, U Zwick arXiv preprint arXiv:1410.7530, 2014 | 7 | 2014 |

Ramsey goes visibly pushdown O Friedmann, F Klaedtke, M Lange International Colloquium on Automata, Languages, and Programming, 224-237, 2013 | 7 | 2013 |