Olaf Beyersdorff

949 total citations
64 papers, 256 citations indexed

About

Olaf Beyersdorff is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Olaf Beyersdorff has authored 64 papers receiving a total of 256 indexed citations (citations by other indexed papers that have themselves been cited), including 55 papers in Computational Theory and Mathematics, 51 papers in Artificial Intelligence and 10 papers in Computer Networks and Communications. Recurrent topics in Olaf Beyersdorff's work include Formal Methods in Verification (39 papers), Logic, programming, and type systems (38 papers) and Logic, Reasoning, and Knowledge (25 papers). Olaf Beyersdorff is often cited by papers focused on Formal Methods in Verification (39 papers), Logic, programming, and type systems (38 papers) and Logic, Reasoning, and Knowledge (25 papers). Olaf Beyersdorff collaborates with scholars based in Germany, United Kingdom and India. Olaf Beyersdorff's 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 and has published in prestigious journals such as Artificial Intelligence, Journal of the ACM and Theoretical Computer Science.

In The Last Decade

Olaf Beyersdorff

53 papers receiving 241 citations

Peers

Olaf Beyersdorff

CTM

AI

CNC

SOFTW

OC

Bartek Klin Poland

Jörg Endrullis Netherlands

H. Peter Gumm Germany

N. Sabadini Italy

Giuseppe Rosolini Italy

Holger Bock Axelsen Denmark

Marino Miculan Italy

Irène Guessarian France

Efim Kinber United States

Fairouz Kamareddine United Kingdom

Bartek Klin Poland

Olaf Beyersdorff

247 ×1.2

CTM

241 ×1.3

AI

21 ×0.7

CNC

12 ×1.5

SOFTW

5 ×0.7

OC

Citations per year, relative to Olaf Beyersdorff Olaf Beyersdorff (= 1×) peers Bartek Klin

Countries citing papers authored by Olaf Beyersdorff

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Beyersdorff, Olaf, et al.. (2024). QCDCL with cube learning or pure literal elimination – What is best?. Artificial Intelligence. 336. 104194–104194.

2.

Beyersdorff, Olaf, Benjamin Böhm, & Meena Mahajan. (2024). Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs. Proceedings of the AAAI Conference on Artificial Intelligence. 38(8). 7943–7951.

3.

Beyersdorff, Olaf, et al.. (2024). QCDCL vs QBF Resolution: Further Insights. Journal of Artificial Intelligence Research. 81. 741–769. 3 indexed citations

4.

Beyersdorff, Olaf & Benjamin Böhm. (2023). Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution. Logical Methods in Computer Science. Volume 19, Issue 2. 53. 3 indexed citations

5.

Beyersdorff, Olaf, et al.. (2023). Classes of Hard Formulas for QBF Resolution. Journal of Artificial Intelligence Research. 77. 1455–1487. 1 indexed citations

6.

Böhm, Benjamin & Olaf Beyersdorff. (2023). Lower Bounds for QCDCL via Formula Gauge. Journal of Automated Reasoning. 67(4). 1 indexed citations

7.

Beyersdorff, Olaf, et al.. (2020). Building Strategies into QBF Proofs. Journal of Automated Reasoning. 65(1). 125–154. 1 indexed citations

8.

Beyersdorff, Olaf, et al.. (2019). Characterising tree-like Frege proofs for QBF. Information and Computation. 268. 104429–104429. 2 indexed citations

9.

Beyersdorff, Olaf, et al.. (2018). Reinterpreting Dependency Schemes: Soundness Meets Incompleteness in DQBF. Journal of Automated Reasoning. 63(3). 597–623. 5 indexed citations

10.

Beyersdorff, Olaf, et al.. (2017). Formulas with Large Weight: a New Technique for Genuine QBF Lower Bounds.. 24. 32. 1 indexed citations

11.

Shukla, Anil, et al.. (2017). Feasible Interpolation for QBF Resolution Calculi. Logical Methods in Computer Science. 13. 5 indexed citations

12.

Beyersdorff, Olaf, et al.. (2017). Feasible Interpolation for QBF Resolution Calculi. Logical Methods in Computer Science. Volume 13, Issue 2. 3 indexed citations

13.

Beyersdorff, Olaf, et al.. (2016). Extension Variables in QBF Resolution.. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 23. 5. 2 indexed citations

14.

Beyersdorff, Olaf, et al.. (2015). Lower bounds: from circuits to QBF proof systems.. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 22. 133. 7 indexed citations

15.

Janota, Mikoláš, et al.. (2014). On Unification of QBF Resolution-Based Calculi.. Electronic colloquium on computational complexity. 21. 36. 1 indexed citations

16.

Beyersdorff, Olaf, et al.. (2014). The Complexity of Theorem Proving in Circumscription and Minimal Entailment.. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 21. 14.

17.

Beyersdorff, Olaf, Nicola Galesi, & Massimo Lauria. (2013). Parameterized Complexity of DPLL Search Procedures. ACM Transactions on Computational Logic. 14(3). 1–21. 13 indexed citations

18.

Beyersdorff, Olaf, et al.. (2010). Proof systems that take advice. Information and Computation. 209(3). 320–332. 8 indexed citations

19.

Beyersdorff, Olaf, et al.. (2009). Nondeterministic functions and the existence of optimal proof systems. Theoretical Computer Science. 410(38-40). 3839–3855. 6 indexed citations

20.

Beyersdorff, Olaf, et al.. (2009). Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.. White Rose Research Online (University of Leeds, The University of Sheffield, University of York). 16. 81.

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.

Explore authors with similar magnitude of impact