The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jan Johannsen: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jan Johannsen
    On Sharply Bounded Length Induction. [Citation Graph (0, 0)][DBLP]
    CSL, 1995, pp:362-367 [Conf]
  2. Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn
    Linear Ramified Higher Type Recursion and Parallel Complexity. [Citation Graph (0, 0)][DBLP]
    Proof Theory in Computer Science, 2001, pp:1-21 [Conf]
  3. Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
    Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP]
    FOCS, 1998, pp:638-647 [Conf]
  4. Jan Johannsen, Martin Lange
    CTL+ Is Complete for Double Exponential Time. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:767-775 [Conf]
  5. Jan Johannsen
    On the Weakness of Sharply Bounded Polynomial Induction. [Citation Graph (0, 0)][DBLP]
    Kurt Gödel Colloquium, 1993, pp:223-230 [Conf]
  6. Jan Johannsen
    Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable's Class K. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:268-274 [Conf]
  7. Jan Johannsen, Chris Pollett
    On Proofs about Threshold Circuits and Counting Hierarchies. [Citation Graph (0, 0)][DBLP]
    LICS, 1998, pp:444-452 [Conf]
  8. Jan Johannsen, N. S. Narayanaswamy
    An Optimal Lower Bound for Resolution with 2-Conjunctions. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:387-398 [Conf]
  9. Jan Johannsen
    Satisfiability Problems Complete for Deterministic Logarithmic Space. [Citation Graph (0, 0)][DBLP]
    STACS, 2004, pp:317-325 [Conf]
  10. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
    An exponential separation between regular and general resolution. [Citation Graph (0, 0)][DBLP]
    STOC, 2002, pp:448-456 [Conf]
  11. Klaus Aehlig, Jan Johannsen
    An Elementary Fragment of Second-Order Lambda Calculus [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  12. Michael Alekhnovich, Jan Johannsen, Toniann Pitassi, Alasdair Urquhart
    An Exponential Separation between Regular and General Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:8, n:056, pp:- [Journal]
  13. Jan Johannsen
    Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-like Cutting Planes [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:32, pp:- [Journal]
  14. Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
    Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:35, pp:- [Journal]
  15. Markus Jehle, Jan Johannsen, Martin Lange, Nicolas Rachinsky
    Bounded Model Checking for All Regular Properties. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:144, n:1, pp:3-18 [Journal]
  16. Jan Johannsen
    Lower Bounds for Monotone Real Circuit Depth and Formula Size and Tree-Like Cutting Planes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:67, n:1, pp:37-41 [Journal]
  17. Jan Johannsen
    Depth Lower Bounds for Monotone Semi-Unbounded Fan-in Circuits. [Citation Graph (0, 0)][DBLP]
    ITA, 2001, v:35, n:3, pp:277-286 [Journal]
  18. Jan Johannsen
    The Complexity of Pure Literal Elimination. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2005, v:35, n:1-3, pp:89-95 [Journal]
  19. Wolfgang Degen, Jan Johannsen
    Cumulative Higher-Order Logic as a Foundation for Set Theory. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2000, v:46, n:2, pp:147-170 [Journal]
  20. Jan Johannsen
    A Model Theoretic Property of Sharply Bounded Formulae, with some Applications. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:205-215 [Journal]
  21. Jan Johannsen
    A Remark an Independence Results for Sharply Bounded Arithmetic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 1998, v:44, n:, pp:568-570 [Journal]
  22. Arnold Beckmann, Jan Johannsen
    An unexpected separation result in Linearly Bounded Arithmetic. [Citation Graph (0, 0)][DBLP]
    Math. Log. Q., 2005, v:51, n:2, pp:191-200 [Journal]
  23. Maria Luisa Bonet, Juan Luis Esteban, Nicola Galesi, Jan Johannsen
    On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1462-1484 [Journal]
  24. Klaus Aehlig, Jan Johannsen
    An elementary fragment of second-order lambda calculus. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Log., 2005, v:6, n:2, pp:468-480 [Journal]

  25. Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. [Citation Graph (, )][DBLP]


  26. An Exponential Lower Bound for Width-Restricted Clause Learning. [Citation Graph (, )][DBLP]


  27. Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas. [Citation Graph (, )][DBLP]


  28. Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning [Citation Graph (, )][DBLP]


Search in 0.057secs, Finished in 0.060secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002