Olaf Beyersdorff
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 10%
- Computer Networks and Communications
- Software
- Organic Chemistry
- Co-authors
- Mikoláš JanotaMeena MahajanNicola GalesiMichael E. ThomasHeribert VollmerMassimo LauriaArne MeierJohannes Köbler
- Topics
- Formal Methods in Verification (39 papers)Logic, programming, and type systems (38 papers)Logic, Reasoning, and Knowledge (25 papers)
- Partner nations
- GermanyUnited KingdomIndia
In The Last Decade
Olaf Beyersdorff
53 papers receiving 241 citations
Peers
Comparison fields: 5 of 29
- Computational Theory and Mathematics 210
- Artificial Intelligence 189
- Computer Networks and Communications 32
- Software 8
- Organic Chemistry 7
Countries citing papers authored by Olaf Beyersdorff
This map shows the geographic impact of Olaf Beyersdorff'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 Olaf Beyersdorff with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Olaf Beyersdorff more than expected).
Fields of papers citing papers by Olaf Beyersdorff
This network shows the impact of papers produced by Olaf Beyersdorff. 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 Olaf Beyersdorff. The network helps show where Olaf Beyersdorff may publish in the future.
Co-authorship network of co-authors of Olaf Beyersdorff
This figure shows the co-authorship network connecting the top 25 collaborators of Olaf Beyersdorff. A scholar is included among the top collaborators of Olaf Beyersdorff based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Olaf Beyersdorff. Olaf Beyersdorff is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | 3 | |
| 4 | 3 | |
| 5 | 1 | |
| 6 | 1 | |
| 7 | 1 | |
| 8 | 2 | |
| 9 | 5 | |
| 10 | Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds. | 1 |
| 11 | Feasible Interpolation for QBF Resolution Calculi | 5 |
| 12 | 3 | |
| 13 | Extension Variables in QBF Resolution. | 2 |
| 14 | Lower bounds: from circuits to QBF proof systems. | 7 |
| 15 | On Unification of QBF Resolution-Based Calculi. | 1 |
| 16 | The Complexity of Theorem Proving in Circumscription and Minimal Entailment. | 0 |
| 17 | 13 | |
| 18 | 8 | |
| 19 | 6 | |
| 20 | Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes. | 0 |
About Olaf Beyersdorff
Olaf Beyersdorff is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Software, having authored 64 papers that have together received 256 indexed citations. Recurring topics across this work include Formal Methods in Verification (39 papers), Logic, programming, and type systems (38 papers) and Logic, Reasoning, and Knowledge (25 papers). The work is most often cited by research in Computational Theory and Mathematics (210 citations), Artificial Intelligence (189 citations) and Software (8 citations). Olaf Beyersdorff has collaborated with scholars based in Germany, United Kingdom and India. Frequent co-authors include Mikoláš Janota, Meena Mahajan, Nicola Galesi, Michael E. Thomas, Heribert Vollmer, Massimo Lauria, Arne Meier, Johannes Köbler, Anil Shukla and Benjamin Böhm. Their work appears in journals such as Artificial Intelligence, Journal of the ACM and Theoretical 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.