- O. Friedmann: Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs, in Paderborn 2012, PhD Colloquium Logicum, DVMLG
- O. Friedmann: A subexponential lower bound for the Least Recently Considered rule for solving linear programs and games, in Berlin 2012, Symposium for Discrete Mathematics
- O. Friedmann: Discrete Strategy Improvement for Solving Parity Games, Guest Lecture in Berlin 2011, Logic, Games and Automata
- O. Friedmann: Exponential lower bounds for determined game policy iteration and linear program simplex methods, in Berlin 2011, Methods for Discrete Structures, Monday-lectures
- O. Friedmann: Subexponential Lower Bounds for the Simplex Algorithm, in Los Angeles 2011, IPAM UCLA, Efficiency of the Simplex Method: Quo vadis Hirsch conjecture?
- O. Friedmann: A subexponential lower bound for the Random Facet algorithm for Parity Games, in Zurich 2010, Optimization and Applications Seminar, ETHZ
- O. Friedmann: An Exponential Lower Bound for Strategy Iteration, in Dagstuhl 2010, Equilibrium Computation Seminar
- O. Friedmann: An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms, in Tel Aviv 2010, Theory of Computation Seminar, Tel Aviv University
- O. Friedmann: An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms, in Paris 2010, Ecole Polytechnique
