default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOliver Friedmann
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j12]Yann Disser
, Oliver Friedmann, Alexander V. Hopp:
An exponential lower bound for Zadeh's pivot rule. Math. Program. 199(1): 865-936 (2023)
2010 – 2019
- 2019
- [i6]Yann Disser, Oliver Friedmann, Alexander V. Hopp:
An Exponential Lower Bound for Zadeh's pivot rule. CoRR abs/1911.01074 (2019) - 2017
- [j11]David Avis, Oliver Friedmann:
An exponential lower bound for Cunningham's rule. Math. Program. 161(1-2): 271-305 (2017) - 2015
- [j10]Florian Bruse, Oliver Friedmann, Martin Lange:
On guarded transformation in the modal μ-calculus. Log. J. IGPL 23(2): 194-216 (2015) - [j9]Oliver Friedmann, Felix Klaedtke, Martin Lange:
Ramsey-Based Inclusion Checking for Visibly Pushdown Automata. ACM Trans. Comput. Log. 16(4): 34:1-34:24 (2015) - 2014
- [i5]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Random-Facet and Random-Bland require subexponential time even for shortest paths. CoRR abs/1410.7530 (2014) - [i4]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Errata for: A subexponential lower bound for the Random Facet algorithm for Parity Games. CoRR abs/1410.7871 (2014) - 2013
- [j8]Oliver Friedmann, Markus Latte, Martin Lange:
Satisfiability Games for Branching-Time Logics. Log. Methods Comput. Sci. 9(4) (2013) - [j7]Oliver Friedmann:
A superpolynomial lower bound for strategy iteration based on snare memorization. Discret. Appl. Math. 161(10-11): 1317-1337 (2013) - [j6]Oliver Friedmann, Martin Lange:
Deciding the unguarded modal µ-calculus. J. Appl. Non Class. Logics 23(4): 353-371 (2013) - [c11]Oliver Friedmann, Felix Klaedtke, Martin Lange:
Ramsey Goes Visibly Pushdown. ICALP (2) 2013: 224-237 - [i3]Florian Bruse, Oliver Friedmann, Martin Lange:
Guarded Transformation for the Modal mu-Calculus. CoRR abs/1305.0648 (2013) - [i2]David Avis, Oliver Friedmann:
An exponential lower bound for Cunningham's rule. CoRR abs/1305.3944 (2013) - 2012
- [j5]Oliver Friedmann, Martin Lange:
Two Local Strategy Iteration Schemes for Parity Game Solving. Int. J. Found. Comput. Sci. 23(3): 669-685 (2012) - [c10]Oliver Friedmann, Martin Lange:
Ramsey-Based Analysis of Parity Automata. TACAS 2012: 64-78 - 2011
- [b1]Oliver Friedmann:
Exponential Lower Bounds for Solving Infinitary Payoff Games and Linear Programs. Ludwig Maximilians University Munich, 2011 - [j4]Oliver Friedmann:
An Exponential Lower Bound for the Latest Deterministic Strategy Iteration Algorithms. Log. Methods Comput. Sci. 7(3) (2011) - [j3]Oliver Friedmann:
Recursive algorithm for parity games requires exponential time. RAIRO Theor. Informatics Appl. 45(4): 449-457 (2011) - [j2]Oliver Friedmann, Martin Lange:
More on balanced diets. J. Funct. Program. 21(2): 135-157 (2011) - [c9]Oliver Friedmann:
A Subexponential Lower Bound for Zadeh's Pivoting Rule for Solving Linear Programs and Games. IPCO 2011: 192-206 - [c8]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
A subexponential lower bound for the Random Facet algorithm for Parity Games. SODA 2011: 202-216 - [c7]Oliver Friedmann, Thomas Dueholm Hansen, Uri Zwick:
Subexponential lower bounds for randomized pivoting rules for the simplex algorithm. STOC 2011: 283-292 - [c6]Oliver Friedmann, Martin Lange:
The Modal μ-Calculus Caught Off Guard. TABLEAUX 2011: 149-163 - [p1]Oliver Friedmann:
Exponentielle untere Schranken zur Lösung infinitärer Auszahlungsspiele und linearer Programme. Ausgezeichnete Informatikdissertationen 2011: 51-60 - 2010
- [j1]Oliver Friedmann:
The Stevens-Stirling-Algorithm for Solving Parity Games Locally Requires Exponential Time. Int. J. Found. Comput. Sci. 21(3): 277-287 (2010) - [c5]Oliver Friedmann, Markus Latte, Martin Lange:
A Decision Procedure for CTL* Based on Tableaux and Automata. IJCAR 2010: 331-345 - [c4]Oliver Friedmann, Martin Lange:
Local Strategy Improvement for Parity Game Solving. GANDALF 2010: 118-131
2000 – 2009
- 2009
- [c3]Oliver Friedmann, Martin Lange:
Solving Parity Games in Practice. ATVA 2009: 182-196 - [c2]Oliver Friedmann:
An Exponential Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. LICS 2009: 145-156 - [c1]Oliver Friedmann, Martin Lange:
A Solver for Modal Fixpoint Logics. M4M 2009: 99-111 - [i1]Oliver Friedmann:
A Super-Polynomial Lower Bound for the Parity Game Strategy Improvement Algorithm as We Know it. CoRR abs/0901.2731 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:39 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
