Solving Parity Games in Practice. - Oliver Friedmann; Martin Lange (ATVA, 2009)

An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. - Oliver Friedmann (LICS, 2009)

A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it - Oliver Friedmann (CoRR, 2009)

A Solver for Modal Fixpoint Logics. - Oliver Friedmann; Martin Lange (M4M, 2009)

A Decision Procedure for CTL* Based on Tableaux and Automata. - Oliver Friedmann; Markus Latte; Martin Lange (IJCAR, 2010)

Local Strategy Improvement for Parity Game Solving - Oliver Friedmann; Martin Lange (GANDALF, 2010)

The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time. - Oliver Friedmann (Int. J. Found. Comput. Sci., 2010)

Exponentielle untere Schranken zur Lösung infinitärer Auszahlungsspiele und linearer Programme. - Oliver Friedmann (Ausgezeichnete Informatikdissertationen, 2011)

A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. - Oliver Friedmann (IPCO, 2011)

A subexponential lower bound for the Random Facet algorithm for Parity Games. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (SODA, 2011)

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (STOC, 2011)

The Modal μ-Calculus Caught Off Guard. - Oliver Friedmann; Martin Lange (TABLEAUX, 2011)

An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms - Oliver Friedmann (Log. Methods Comput. Sci., 2011)

Recursive algorithm for parity games requires exponential time. - Oliver Friedmann (RAIRO Theor. Informatics Appl., 2011)

More on balanced diets. - Oliver Friedmann; Martin Lange (J. Funct. Program., 2011)

Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs. - Oliver Friedmann (2011)

Ramsey-Based Analysis of Parity Automata. - Oliver Friedmann; Martin Lange (TACAS, 2012)

Two Local Strategy Iteration Schemes for Parity Game Solving. - Oliver Friedmann; Martin Lange (Int. J. Found. Comput. Sci., 2012)

Ramsey Goes Visibly Pushdown. - Oliver Friedmann; Felix Klaedtke; Martin Lange (ICALP (2), 2013)

Satisfiability Games for Branching-Time Logics. - Oliver Friedmann; Markus Latte; Martin Lange (Log. Methods Comput. Sci., 2013)

Guarded Transformation for the Modal mu-Calculus - Florian Bruse; Oliver Friedmann; Martin Lange (CoRR, 2013)

A superpolynomial lower bound for strategy iteration based on snare memorization. - Oliver Friedmann (Discret. Appl. Math., 2013)

Deciding the unguarded modal µ-calculus. - Oliver Friedmann; Martin Lange (J. Appl. Non Class. Logics, 2013)

Random-Facet and Random-Bland require subexponential time even for shortest paths. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (CoRR, 2014)

Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. - Oliver Friedmann; Thomas Dueholm Hansen; Uri Zwick (CoRR, 2014)

On guarded transformation in the modal μ-calculus. - Florian Bruse; Oliver Friedmann; Martin Lange (Log. J. IGPL, 2015)

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. - Oliver Friedmann; Felix Klaedtke; Martin Lange (ACM Trans. Comput. Log., 2015)

An exponential lower bound for Cunningham's rule. - David Avis; Oliver Friedmann (Math. Program., 2017)

An exponential lower bound for Zadeh's pivot rule. - Yann Disser; Oliver Friedmann; Alexander V. Hopp (Math. Program., 2023)