# Jan Johannsen

Affiliations:- Ludwig Maximilian University of Munich, Germany

According to our database

Collaborative distances:

^{1}, Jan Johannsen authored at least 34 papers between 1993 and 2020.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Dataset Other## Links

#### Online presence:

#### On csauthors.net:

## Bibliography

2020

J. Satisf. Boolean Model. Comput., 2020

Simplified and Improved Separations Between Regular and General Resolution by Lifting.

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2020, 2020

2016

J. Satisf. Boolean Model. Comput., 2016

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2016, 2016

2014

J. Artif. Intell. Res., 2014

2013

Electron. Colloquium Comput. Complex., 2013

2011

Proceedings of the IJCAI 2011, 2011

2010

Electron. Colloquium Comput. Complex., 2010

2009

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

2008

Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning.

Log. Methods Comput. Sci., 2008

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2005

ACM Trans. Comput. Log., 2005

Math. Log. Q., 2005

J. Autom. Reason., 2005

Proceedings of the Third International Workshop on Bounded Model Checking, 2005

2004

Proceedings of the STACS 2004, 2004

2003

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Proceedings of the Mathematical Foundations of Computer Science 2002, 2002

2001

RAIRO Theor. Informatics Appl., 2001

Electron. Colloquium Comput. Complex., 2001

Proceedings of the Proof Theory in Computer Science, International Seminar, 2001

2000

On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems.

SIAM J. Comput., 2000

Math. Log. Q., 2000

1999

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998

Math. Log. Q., 1998

Math. Log. Q., 1998

Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes.

Inf. Process. Lett., 1998

Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems

Electron. Colloquium Comput. Complex., 1998

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

1996

PhD thesis, 1996

Proceedings of the Proof Complexity and Feasible Arithmetics, 1996

1995

Proceedings of the Computer Science Logic, 9th International Workshop, 1995

1994

Arch. Math. Log., 1994

1993

Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993