Oliver Friedmann
German computer scientist and mathematician
From Wikipedia, the free encyclopedia
Oliver Friedmann is a German computer scientist and mathematician known for his work on parity games and the simplex algorithm.[1]
Oliver Friedmann | |
|---|---|
| Education | Ludwig Maximilian University of Munich (Diploma and Doctorate) |
| Occupations | CTO, Computer scientist |
| Known for | Lower bounds on Parity game algorithms |
Friedmann earned his doctorate's degree from the Ludwig Maximilian University of Munich in 2011 under the supervision of Martin Hofmann and Martin Lange.[2]
Awards
He won the Kleene Award[3] for showing that state-of-the-art policy iteration algorithms for parity games require exponential time in the worst case.[4] He and his coauthors extended the proof techniques to the simplex algorithm and to policy iteration for Markov decision processes.[5] His seminal body of work on lower bounds in convex optimization, leading to a sub-exponential lower bound[6] for Zadeh's rule, was awarded with the Tucker Prize.[7]