Publications

Accepted Papers

  1. Y. Disser, O. Friedmann, A. Hopp: An exponential lower bound for Zadeh’s pivot rule. In Mathematical Programming, 2022. [Preprint]
  2. D. Avis, O. Friedmann: An exponential lower bound for Cunningham’s rule. In Mathematical Programming Series A, 2016. [Preprint]. Additional material: [Animation Parity Game].
  3. O. Friedmann, F. Klaedtke, M. Lange: Ramsey-based Inclusion Checking for Visibly Pushdown Automata. In Transactions on Computational Logic, 2015.
  4. F. Bruse, O. Friedmann, M. Lange: On Guarded Transformation in the Modal Mu-Calculus. In Oxford Journal of the IGPL, 2014.
  5. O. Friedmann, M. Lange: Deciding the Unguarded Modal mu-Calculus. In Journal of Applied Non-Classical Logics, 2013. [Preprint].
  6. O. Friedmann, M. Latte, M. Lange: Satisfiability Games for Branching-Time Logics. In Logical Methods in Computer Science, 2013, Volume 9, Issue 4. [Preprint].
  7. F. Bruse, O. Friedmann, M. Lange: Guarded Transformation for the Modal Mu-Calculus. In Highlights of Logic, Games and Automata, 2013, Paris, France. [Preprint].
  8. O. Friedmann, F. Klaedtke, M. Lange: Ramsey Goes Visibly Pushdown. In the 40th International Colloquium on Automata, Languages and Programming, ICALP’2013, Riga, Latvia, 2013. [Preprint].
  9. O. Friedmann: A Subexponential Lower Bound for Strategy Iteration based on Snare Memorization. In Discrete Applied Mathematics, Volume 161, Issues 10–11, 2013. [Preprint]. Additional material: [Animation Original Game with Switch All, Animation Original Game with Greedy Snares, Animation Enhanced Game with Switch All, Animation Enhanced Game with Greedy Snares]
  10. O. Friedmann: A subexponential lower bound for the Least Recently
    Considered rule for solving linear programs and games    . In the Annual Workshop of the ESF Networking Programme on Games for Design and Verification, GAMES’2012, Napoli, Italy, 2012. [Preprint]. Additional material: [Animation]
  11. O. Friedmann, M. Lange: Ramsey-Based Analysis of Parity Automata. In Proceedings of the 18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’2012, Tallinn, Estonia, 2012. [Preprint]
  12. O. Friedmann: Recursive Algorithm for Parity Games requires Exponential Time. In RAIRO – Theoretical Informatics and Applications, Cambridge Journals, 2011. [Preprint]
  13. O. Friedmann, M. Lange: Two Local Strategy Improvement Schemes for Parity Game solving. In Journal of Foundations of Computer Science, Selected Papers of the Conference GandALF 2010. [Preprint]
  14. O. Friedmann: An Exponential Lower Bound For The Latest Deterministic
    Strategy Iteration Algorithms    . In Logical Methods in Computer Science, Selected Papers of the Conference LICS 2009. [Preprint]
  15. O. Friedmann, M. Lange: The Modal Mu-Calculus Caught off Guard. In Proceedings of the 20th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX’11, Bern, Switzerland, 2011. [Preprint]
  16. O. Friedmann, T. Hansen, U. Zwick: Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. In Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC’11, San Jose, CA, USA, 2011. Winner of the Best Paper Award. [Preprint]
  17. O. Friedmann: A subexponential lower bound for Zadeh’s pivoting rule for solving linear programs and games. In Proceedings of the 15th Conference on Integer Programming and Combinatorial Optimization, IPCO’11, New York, NY, USA, 2011. Awarded with Zadeh’s Prize. [Preprint]
  18. O. Friedmann, M. Lange: More on Balanced Diets. In Journal of Functional Programming, volume 21, issue 02, pp. 135-157. [Preprint]
  19. O. Friedmann, T. Hansen, U. Zwick: A subexponential lower bound for the Random Facet algorithm for Parity Games. In Proceedings of the Symposium on Discrete Algorithms, SODA’11, San Francisco, CA, USA, 2011. [Preprint]
  20. O. Friedmann, M. Lange: Local Strategy Improvement for Parity Game Solving. In Proceedings of the First International Symposium on Games, Automata, Logics and Formal Verification, GandALF’2010, Minori, Italy, 2010. [Preprint]
  21. O. Friedmann, M. Latte: Decision Procedures for CTL*. In Proceedings of the 2010 International Workshop on Comparing Logical Decision Methods, CLoDeM’2010, Edinburgh, United Kingdom, 2010. [Preprint]
  22. O. Friedmann, M. Lange, M. Latte: A Decision Procedure for CTL* Based on Tableaux and Automata. In Proceedings of the 2010 International Joint Conference on Automated Reasoning, IJCAR’2010, Edinburgh, United Kingdom, 2010. [Preprint]
  23. O. Friedmann: The Stevens-Stirling-Algorithm For Solving Parity Games Locally Requires Exponential Time. In International Journal of Foundations of Computer Science, Volume 21, Issue 3 (June 2010). [Preprint]
  24. O. Friedmann, M. Lange: A Solver for Modal Fixpoint Logics. In Proceedings of the 6th Workshop on Methods for Modalities, M4M-6, Copenhagen, Denmark, 2009. [Preprint]
  25. O. Friedmann, M. Lange: Tableaux with Automata. In Proceedings Workshop on Tableaux vs. Automata as Logical Decision Procedures, AutoTab’2009, Oslo, Norway, 2009. [Preprint]
  26. O. Friedmann, M. Lange: Solving Parity Games in Practice. In Proceedings of the 7th Int. Symp. on Automated Technology for Verification and Analysis, ATVA’09, Macao, China, 2009. [Preprint]
  27. O. Friedmann: An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. In Proceedings of the 24th Annual IEEE Symposium on Logic in Computer Science, LICS’09, Los Angeles, CA, USA, 2009. Winner of the Kleene Award 2009. [Preprint]