default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJan Johannsen
Person information
- affiliation: Ludwig Maximilian University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j15]Jan Johannsen:
Backdoors into Two Occurrences. J. Satisf. Boolean Model. Comput. 12(1): 1-15 (2020)- [c19]Marc Vinyals
, Jan Elffers, Jan Johannsen, Jakob Nordström:
Simplified and Improved Separations Between Regular and General Resolution by Lifting. SAT 2020: 182-200
2010 – 2019
- 2016
- [j14]Sam Buss, Jan Johannsen:
On Linear Resolution. J. Satisf. Boolean Model. Comput. 10(1): 23-35 (2016) - [c18]Jan Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals:
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers. SAT 2016: 160-176 - 2014
- [j13]Maria Luisa Bonet, Sam Buss, Jan Johannsen:
Improved Separations of Regular Resolution from Clause Learning Proof Systems. J. Artif. Intell. Res. 49: 669-703 (2014) - 2013
- [c17]Jan Johannsen:
Exponential Separations in a Hierarchy of Clause Learning Proof Systems. SAT 2013: 40-51 - [i8]Jan Johannsen:
Exponential Separations in a Hierarchy of Clause Learning Proof Systems. Electron. Colloquium Comput. Complex. TR13 (2013) - 2012
- [i7]Maria Luisa Bonet, Sam Buss, Jan Johannsen:
Improved Separations of Regular Resolution from Clause Learning Proof Systems. CoRR abs/1208.2469 (2012) - 2011
- [c16]Eli Ben-Sasson, Jan Johannsen:
Lower Bounds for Width-Restricted Clause Learning on Formulas of Small Width. IJCAI 2011: 2570-2575 - 2010
- [c15]Eli Ben-Sasson, Jan Johannsen:
Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. SAT 2010: 16-29 - [i6]Eli Ben-Sasson, Jan Johannsen:
Lower bounds for width-restricted clause learning on small width formulas. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [c14]Jan Johannsen:
An Exponential Lower Bound for Width-Restricted Clause Learning. SAT 2009: 128-140 - 2008
- [j12]Samuel R. Buss, Jan Hoffmann, Jan Johannsen:
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning. Log. Methods Comput. Sci. 4(4) (2008) - [c13]Hermann Gruber, Jan Johannsen:
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. FoSSaCS 2008: 273-286 - [i5]Samuel R. Buss, Jan Hoffmann, Jan Johannsen:
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning. CoRR abs/0811.1075 (2008) - 2007
- [j11]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution. Theory Comput. 3(1): 81-102 (2007) - 2005
- [j10]Jan Johannsen:
The Complexity of Pure Literal Elimination. J. Autom. Reason. 35(1-3): 89-95 (2005) - [j9]Arnold Beckmann, Jan Johannsen:
An unexpected separation result in Linearly Bounded Arithmetic. Math. Log. Q. 51(2): 191-200 (2005) - [j8]Klaus Aehlig, Jan Johannsen:
An elementary fragment of second-order lambda calculus. ACM Trans. Comput. Log. 6(2): 468-480 (2005) - [c12]Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky:
Bounded Model Checking for All Regular Properties. BMC@CAV 2005: 3-18 - 2004
- [c11]Jan Johannsen:
Satisfiability Problems Complete for Deterministic Logarithmic Space. STACS 2004: 317-325 - 2003
- [c10]Jan Johannsen, Martin Lange:
CTL+ Is Complete for Double Exponential Time. ICALP 2003: 767-775 - 2002
- [c9]Jan Johannsen, N. S. Narayanaswamy:
An Optimal Lower Bound for Resolution with 2-Conjunctions. MFCS 2002: 387-398 - [c8]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An exponential separation between regular and general resolution. STOC 2002: 448-456 - [i4]Klaus Aehlig, Jan Johannsen:
An Elementary Fragment of Second-Order Lambda Calculus. CoRR cs.LO/0210022 (2002) - 2001
- [j7]Jan Johannsen:
Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits. RAIRO Theor. Informatics Appl. 35(3): 277-286 (2001) - [c7]Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn:
Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science 2001: 1-21 - [i3]Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart:
An Exponential Separation between Regular and General Resolution. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [j6]Wolfgang Degen, Jan Johannsen:
Cumulative Higher-Order Logic as a Foundation for Set Theory. Math. Log. Q. 46(2): 147-170 (2000) - [j5]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. SIAM J. Comput. 30(5): 1462-1484 (2000)
1990 – 1999
- 1999
- [c6]Jan Johannsen:
Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. LICS 1999: 268-274 - 1998
- [j4]Jan Johannsen:
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes. Inf. Process. Lett. 67(1): 37-41 (1998) - [j3]Jan Johannsen:
A Model Theoretic Property of Sharply Bounded Formulae, with some Applications. Math. Log. Q. 44: 205-215 (1998) - [j2]Jan Johannsen:
A Remark on Independence Results for Sharply Bounded Arithmetic. Math. Log. Q. 44: 568-570 (1998) - [c5]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. FOCS 1998: 638-647 - [c4]Jan Johannsen, Chris Pollett:
On Proofs about Threshold Circuits and Counting Hierarchies. LICS 1998: 444-452 - [i2]Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen:
Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [i1]Jan Johannsen:
Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes. Electron. Colloquium Comput. Complex. TR97 (1997) - 1996
- [b1]Jan Johannsen:
Schwache Fragmente der Arithmetik und Schwellwertschaltkreise beschränkter Tiefe. University of Erlangen-Nuremberg, Germany, 1996, pp. 1-118 - [c3]Jan Johannsen:
Equational calculi and constant depth propositional proofs. Proof Complexity and Feasible Arithmetics 1996: 149-162 - 1995
- [c2]Jan Johannsen:
On Sharply Bounded Length Induction. CSL 1995: 362-367 - 1994
- [j1]Jan Johannsen:
A note on sharply bounded arithmetic. Arch. Math. Log. 33(2): 159-165 (1994) - 1993
- [c1]Jan Johannsen:
On the Weakness of Sharply Bounded Polynomial Induction. Kurt Gödel Colloquium 1993: 223-230
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
