Search results for: Olaf Beyersdorff
Information Processing Letters > 2018 > 138 > C > 1-6
Journal of Automated Reasoning > 2019 > 63 > 3 > 597-623
Lecture Notes in Computer Science > Computer Science – Theory and Applications > Theory Track > 80-91
Lecture Notes in Computer Science > FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science > Contributed Papers > 122-134
Lecture Notes in Computer Science > Language and Automata Theory and Applications > Regular Papers > 164-175
Lecture Notes in Computer Science > Theory and Applications of Models of Computation > Contributed Lectures > 318-329
Lecture Notes in Computer Science > Theory and Applications of Satisfiability Testing - SAT 2009 > Complexity Theory > 51-64
Lecture Notes in Computer Science > Theory and Applications of Models of Computation > Special Sessions > 50-59
Lecture Notes in Computer Science > Computer Science - Theory and Applications > Accepted Papers > 47-58
Lecture Notes in Computer Science > Mathematical Foundations of Computer Science 2011 > Contributed Papers > 84-95
Lecture Notes in Computer Science > Theory and Applications of Models of Computation > Computational Complexity > 236-247
Lecture Notes in Computer Science > Theory and Applications of Models of Computation > Special Sessions > 15-27
Lecture Notes in Computer Science > FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science > Contributed Papers > 241-252
Lecture Notes in Computer Science > Automata, Languages and Programming > Session A14: Proof Complexity > 630-641
Lecture Notes in Computer Science > Theory and Applications of Satisfiability Testing - SAT 2009 > Complexity Theory > 65-72
Lecture Notes in Computer Science > Theory and Applications of Satisfiability Testing – SAT 2010 > Part 2. Regular Papers > 30-43
Information Processing Letters > 2013 > 113 > 18 > 666-671
Mathematical Logic Quarterly > 57 > 6 > 535 - 550
Information and Computation > 2011 > 209 > 3 > 320-332