Oliver Friedmann

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 3

Top Venues

CoRR

Math. Program.

Log. J. IGPL

ACM Trans. Comput. Log.

Ludwig Maximilians University Munich (PHD)

Education History

Ludwig Maximilians University Munich

PHD

Publications

Yann Disser, Oliver Friedmann, Alexander V. Hopp
An exponential lower bound for Zadeh's pivot rule. Math. Program. 199 (1) (2023)
Yann Disser, Oliver Friedmann, Alexander V. Hopp
An Exponential Lower Bound for Zadeh's pivot rule. CoRR (2019)
David Avis, Oliver Friedmann
An exponential lower bound for Cunningham's rule. Math. Program. 161 (1-2) (2017)
Florian Bruse, Oliver Friedmann, Martin Lange
On guarded transformation in the modal μ-calculus. Log. J. IGPL 23 (2) (2015)
Oliver Friedmann, Felix Klaedtke, Martin Lange
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. ACM Trans. Comput. Log. 16 (4) (2015)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR (2014)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR (2014)
Oliver Friedmann, Martin Lange
Deciding the unguarded modal µ-calculus. J. Appl. Non Class. Logics 23 (4) (2013)
Oliver Friedmann, Markus Latte, Martin Lange
Satisfiability Games for Branching-Time Logics. Log. Methods Comput. Sci. 9 (4) (2013)
Oliver Friedmann, Felix Klaedtke, Martin Lange
Ramsey Goes Visibly Pushdown. ICALP (2) (2013)
Florian Bruse, Oliver Friedmann, Martin Lange
Guarded Transformation for the Modal mu-Calculus CoRR (2013)
David Avis, Oliver Friedmann
An exponential lower bound for Cunningham's rule CoRR (2013)
Oliver Friedmann
A superpolynomial lower bound for strategy iteration based on snare memorization. Discret. Appl. Math. 161 (10-11) (2013)
Oliver Friedmann, Martin Lange
Ramsey-Based Analysis of Parity Automata. TACAS (2012)
Oliver Friedmann, Martin Lange
Two Local Strategy Iteration Schemes for Parity Game Solving. Int. J. Found. Comput. Sci. 23 (3) (2012)
Oliver Friedmann
Recursive algorithm for parity games requires exponential time. RAIRO Theor. Informatics Appl. 45 (4) (2011)
Oliver Friedmann, Martin Lange
More on balanced diets. J. Funct. Program. 21 (2) (2011)
Oliver Friedmann
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms Log. Methods Comput. Sci. 7 (3) (2011)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA (2011)
Oliver Friedmann
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. IPCO (2011)
Oliver Friedmann
Exponentielle untere Schranken zur Lösung infinitärer Auszahlungsspiele und linearer Programme. Ausgezeichnete Informatikdissertationen (2011)
Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC (2011)
Oliver Friedmann, Martin Lange
-Calculus Caught Off Guard. TABLEAUX (2011)
Oliver Friedmann, Martin Lange
Local Strategy Improvement for Parity Game Solving GANDALF (2010)
Oliver Friedmann, Markus Latte, Martin Lange
Based on Tableaux and Automata. IJCAR (2010)
Oliver Friedmann
The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time. Int. J. Found. Comput. Sci. 21 (3) (2010)
Oliver Friedmann, Martin Lange
A Solver for Modal Fixpoint Logics. Electron. Notes Theor. Comput. Sci. 262 (2010)
Oliver Friedmann, Martin Lange
Solving Parity Games in Practice. ATVA (2009)
Oliver Friedmann
A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it CoRR (2009)
Oliver Friedmann
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. LICS (2009)

Oliver Friedmann.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Oliver Friedmann