Travelled to:1 × Canada
1 × Finland
1 × Hungary
1 × Italy
1 × The Netherlands
1 × USA
2 × United Kingdom
Collaborated with:∅ E.Ben-Sasson H.Gruber M.Lange C.Pollett M.Alekhnovich T.Pitassi A.Urquhart
Talks about:exponenti (4) bound (4) width (3) lower (3) learn (3) claus (3) hierarchi (2) restrict (2) regular (2) separ (2)
Person: Jan Johannsen
DBLP: Johannsen:Jan
Contributed to:
201320102009
2008
2003
2002
19991998Wrote 8 papers:
- SAT-2013-Johannsen #exponential #learning #proving
- Exponential Separations in a Hierarchy of Clause Learning Proof Systems (JJ), pp. 40–51.
- SAT-2010-Ben-SassonJ #bound #learning #strict
- Lower Bounds for Width-Restricted Clause Learning on Small Width Formulas (EBS, JJ), pp. 16–29.
- SAT-2009-Johannsen #bound #exponential #learning #strict
- An Exponential Lower Bound for Width-Restricted Clause Learning (JJ), pp. 128–140.
- FoSSaCS-2008-GruberJ #bound #communication #complexity #regular expression #using
- Optimal Lower Bounds on Regular Expression Size Using Communication Complexity (HG, JJ), pp. 273–286.
- ICALP-2003-JohannsenL #exponential
- CTL+ Is Complete for Double Exponential Time (JJ, ML), pp. 767–775.
- STOC-2002-AlekhnovichJPU #exponential
- An exponential separation between regular and general resolution (MA, JJ, TP, AU), pp. 448–456.
- LICS-1999-Johannsen #bound #problem
- Weak Bounded Arithmetic, the Diffie-Hellman Problem and Constable’s Class K (JJ), pp. 268–274.
- LICS-1998-JohannsenP #on the #proving
- On Proofs about Threshold Circuits and Counting Hierarchies (JJ, CP), pp. 444–452.