Olaf Beyersdorff

Cited by

	All	Since 2017
Citations	1004	634
h-index	20	15
i10-index	31	22

160

120

200620072008200920102011201220132014201520162017201820192020202120226 8 8 32 26 38 44 32 34 53 75 107 93 149 106 140 33

Public access

View all

45 articles

1 article

available

not available

Based on funding mandates

Co-authors

Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Meena MahajanProfessor at The Institute of Mathematical Sciences, HBNI, Chennai, IndiaVerified email at imsc.res.in
Nicola GalesiSapienza University RomeVerified email at uniroma1.it
Massimo LauriaSapienza - Università di RomaVerified email at uniroma1.it
Arne MeierPrivatdozent, Institute of Theoretical Computer Science, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Mikoláš JanotaCTU PragueVerified email at cvut.cz
Anil ShuklaDepartment of CSE, IIT RoparVerified email at iitrpr.ac.in
Johannes KoeblerProfessor of Theoretical Computer Science, Humboldt-University BerlinVerified email at informatik.hu-berlin.de
Ján PichUniversity of OxfordVerified email at cs.ox.ac.uk
Oliver KullmannSwansea UniversityVerified email at Swansea.ac.uk
Renate A SchmidtSchool of Computer Science, The University of ManchesterVerified email at cs.man.ac.uk
Martin SudaCzech Technical University in PragueVerified email at cvut.cz
Ilario BonacinaUniversitat Politècnica de CatalunyaVerified email at cs.upc.edu
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
Thomas SchneiderDept. of Mathematics and Computer Science, University of Bremen, GermanyVerified email at uni-bremen.de
Martina SeidlUniv.-Prof., JKU LinzVerified email at jku.at
Oliver KutzFree University of Bozen-BolzanoVerified email at unibz.it
Tomáš PeitlTU WienVerified email at ac.tuwien.ac.at
Florian LonsingComputer Science Department, Stanford UniversityVerified email at cs.stanford.edu
Christoph M. WintersteigerMicrosoft ResearchVerified email at microsoft.com

Olaf Beyersdorff

Professor of Theoretical Computer Science, Friedrich Schiller University Jena, Germany

Verified email at uni-jena.de - Homepage

Proof Complexity Computational Complexity Computational Logic


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Proof complexity of resolution-based QBF calculi O Beyersdorff, L Chew, M Janota LIPI Symposium on Theoretical Aspects of Computer Science (STACS'15) 30, 76-89, 2015	78	2015
On unification of QBF resolution-based calculi O Beyersdorff, L Chew, M Janota International Symposium on Mathematical Foundations of Computer Science, 81-93, 2014	60	2014
Lower bounds: From circuits to QBF proof systems O Beyersdorff, I Bonacina, C Leroy Proceedings of the 2016 ACM Conference on Innovations in Theoretical …, 2016	47	2016
Parameterized complexity of DPLL search procedures O Beyersdorff, N Galesi, M Lauria ACM Transactions on Computational Logic (TOCL) 14 (3), 1-21, 2013	41	2013
Feasible interpolation for QBF resolution calculi O Beyersdorff, L Chew, M Mahajan, A Shukla International Colloquium on Automata, Languages, and Programming, 180-192, 2015	40	2015
A characterization of tree-like resolution size O Beyersdorff, N Galesi, M Lauria Information Processing Letters 113 (18), 666-671, 2013	34	2013
Are Short Proofs Narrow? QBF Resolution Is Not So Simple O Beyersdorff, L Chew, M Mahajan, A Shukla ACM Transactions on Computational Logic (TOCL) 19 (1), 1-26, 2017	33	2017
The complexity of propositional implication O Beyersdorff, A Meier, M Thomas, H Vollmer Information Processing Letters 109 (18), 1071-1077, 2009	33	2009
A game characterisation of tree-like Q-resolution size O Beyersdorff, L Chew, K Sreenivasaiah Journal of Computer and System Sciences 104, 82-101, 2019	32	2019
Size, cost, and capacity: A semantic technique for hard random QBFs L Hinde, J Blinkhorn, O Beyersdorff Logical Methods in Computer Science 15, 2019	31	2019
The complexity of reasoning for fragments of default logic O Beyersdorff, A Meier, M Thomas, H Vollmer International Conference on Theory and Applications of Satisfiability …, 2009	31	2009
A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover–Delayer games O Beyersdorff, N Galesi, M Lauria Information Processing Letters 110 (23), 1074-1077, 2010	28	2010
Classes of representable disjoint NP-pairs O Beyersdorff Theoretical Computer Science 377 (1), 93-109, 2007	28*	2007
Understanding Gentzen and Frege systems for QBF O Beyersdorff, J Pich 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-10, 2016	27	2016
Parameterized bounded-depth Frege is not optimal O Beyersdorff, N Galesi, M Lauria, AA Razborov ACM Transactions on Computation Theory (TOCT) 4 (3), 7, 2012	27	2012
Unified characterisations of resolution hardness measures O Beyersdorff, O Kullmann International Conference on Theory and Applications of Satisfiability …, 2014	26	2014
Unified characterisations of resolution hardness measures O Beyersdorff, O Kullmann International Conference on Theory and Applications of Satisfiability …, 2014	26	2014
Reasons for hardness in QBF proof systems O Beyersdorff, L Hinde, J Pich ACM Transactions on Computation Theory (TOCT) 12 (2), 1-27, 2020	23	2020
Model checking CTL is almost always inherently sequential O Beyersdorff, A Meier, M Thomas, H Vollmer, M Mundhenk, T Schneider 2009 16th International Symposium on Temporal Representation and Reasoning …, 2009	23	2009
Proof systems that take advice O Beyersdorff, J Köbler, S Müller Information and Computation 209 (3), 320-332, 2011	22*	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors