Oliver Friedmann

Alexander V. Hopp

Math. Program., May, 2023

2017

An exponential lower bound for Cunningham's rule.

[BibT_eX]

[DOI]

David Avis

Math. Program., 2017

2015

Ramsey-Based Inclusion Checking for Visibly Pushdown Automata.

[BibT_eX]

[DOI]

Felix Klaedtke

ACM Trans. Comput. Log., 2015

On guarded transformation in the modal μ-calculus.

[BibT_eX]

[DOI]

Florian Bruse

Log. J. IGPL, 2015

2014

Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games.

[BibT_eX]

[DOI]

CoRR, 2014

Random-Facet and Random-Bland require subexponential time even for shortest paths.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Deciding the unguarded modal µ-calculus.

[BibT_eX]

[DOI]

J. Appl. Non Class. Logics, 2013

A superpolynomial lower bound for strategy iteration based on snare memorization.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Guarded Transformation for the Modal mu-Calculus

[BibT_eX]

[DOI]

Florian Bruse

CoRR, 2013

Satisfiability Games for Branching-Time Logics.

[BibT_eX]

[DOI]

Markus Latte

Log. Methods Comput. Sci., 2013

Ramsey Goes Visibly Pushdown.

[BibT_eX]

[DOI]

Felix Klaedtke

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Two Local Strategy Iteration Schemes for Parity Game Solving.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2012

Ramsey-Based Analysis of Parity Automata.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

2011

Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs.

[BibT_eX]

[DOI]

PhD thesis, 2011

More on balanced diets.

[BibT_eX]

[DOI]

J. Funct. Program., 2011

Recursive algorithm for parity games requires exponential time.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2011

An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms

[BibT_eX]

[DOI]

Log. Methods Comput. Sci., 2011

The Modal <i>μ</i>-Calculus Caught Off Guard.

[BibT_eX]

[DOI]

Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2011

Subexponential lower bounds for randomized pivoting rules for the simplex algorithm.

[BibT_eX]

[DOI]

Proceedings of the 43rd ACM Symposium on Theory of Computing, 2011

A subexponential lower bound for the Random Facet algorithm for Parity Games.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Exponentielle untere Schranken zur Lösung infinitärer Auszahlungsspiele und linearer Programme.

[BibT_eX]

[DOI]

Proceedings of the Ausgezeichnete Informatikdissertationen 2011, 2011

2010

The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2010

Local Strategy Improvement for Parity Game Solving

[BibT_eX]

[DOI]

Proceedings of the Proceedings First Symposium on Games, 2010

A Decision Procedure for CTL<sup>*</sup> Based on Tableaux and Automata.

[BibT_eX]

[DOI]

Markus Latte

Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009

A Solver for Modal Fixpoint Logics.

[BibT_eX]

[DOI]

Proceedings of the 6th Workshop on Methods for Modalities, 2009

A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it

[BibT_eX]

[DOI]

CoRR, 2009

An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, 2009

Solving Parity Games in Practice.

[BibT_eX]

[DOI]