Oliver Friedmann
Impact in
-
- Formal Methods in Verification
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Software top 10%
- Software Testing and Debugging Techniques
Papers in
-
- Formal Methods in Verification 16
- semigroups and automata theory 5
- Complexity and Algorithms in Graphs 5
-
- Logic, programming, and type systems 15
- Artificial Intelligence in Games 7
- Logic, Reasoning, and Knowledge 3
- Co-authors
- Martin Lange (12 shared papers)Thomas Dueholm Hansen (3 shared papers)Uri Zwick (3 shared papers)David Avis (1 shared paper)Felix Klaedtke (2 shared papers)Yann Disser (1 shared paper)
In The Last Decade
Oliver Friedmann
24 papers receiving 353 citations
Peers
Comparison fields: 5 of 30
- Computational Theory and Mathematics 328
- Software 48
- Artificial Intelligence 289
- Computer Graphics and Computer-Aided Design 16
- Discrete Mathematics and Combinatorics 13
Countries citing papers authored by Oliver Friedmann
This map shows the geographic impact of Oliver Friedmann's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Oliver Friedmann with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Oliver Friedmann more than expected).
Fields of papers citing papers by Oliver Friedmann
This network shows the impact of papers produced by Oliver Friedmann. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Oliver Friedmann. The network helps show where Oliver Friedmann may publish in the future.
Co-authors
The 6 scholars most cited alongside Oliver Friedmann, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 24 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2009 | 80 | |
| 2 | 2009 | 54 | |
| 3 | 2011 | 38 | |
| 4 | 2011 | 34 | |
| 5 | AN EXPONENTIAL LOWER BOUND FOR THE LATEST DETERMINISTIC STRATEGY ITERATION ALGORITHMS | 2010 | 25 |
| 6 | 2011 | 24 | |
| 7 | 2010 | 22 | |
| 8 | 2010 | 21 | |
| 9 | A subexponential lower bound for the Random Facet algorithm for Parity Games | 2010 | 11 |
| 10 | 2016 | 10 | |
| 11 | 2014 | 8 | |
| 12 | 2011 | 7 | |
| 13 | 2013 | 7 | |
| 14 | 2013 | 7 | |
| 15 | 2022 | 6 | |
| 16 | 2011 | 5 | |
| 17 | Local Strategy Improvement for Parity Game Solving | 2010 | 5 |
| 18 | 2010 | 5 | |
| 19 | 2013 | 5 | |
| 20 | 2012 | 3 |
About Oliver Friedmann
Oliver Friedmann is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Software, Computer Networks and Communications and Numerical Analysis, having authored 24 papers that have together received 386 indexed citations. Recurring topics across this work include Formal Methods in Verification (16 papers), Logic, programming, and type systems (15 papers), Artificial Intelligence in Games (7 papers), semigroups and automata theory (5 papers), Complexity and Algorithms in Graphs (5 papers), Optimization and Search Problems (4 papers), Logic, Reasoning, and Knowledge (3 papers) and Game Theory and Voting Systems (2 papers). The work is most often cited by research in Computational Theory and Mathematics (328 citations), Software (48 citations), Artificial Intelligence (289 citations), Computer Graphics and Computer-Aided Design (16 citations) and Discrete Mathematics and Combinatorics (13 citations). Oliver Friedmann has collaborated with scholars based in Germany, Denmark and Israel. Frequent co-authors include Martin Lange, Thomas Dueholm Hansen, Uri Zwick, David Avis, Felix Klaedtke and Yann Disser. Their work appears in journals such as Mathematical Programming, International Journal of Foundations of Computer Science, Logic Journal of IGPL, Journal of Applied Non-Classical Logics and Logical Methods in Computer Science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.