Jan Hoffmann

Ph.D. student

Address: Lehrstuhl für Theoretische Informatik Institut für Informatik Ludwig-Maximilians-Universität München Oettingenstraße 67 D-80538 München Office: D 1.05 Phone: +49-89-2180-9864 Email: uni (at) hoffjan . de GnuPG-Key

Office Hours:

By appointment

Interests:

type systems for resource analyses, proof complexity, computational complexity, graph theory (particularly the minor theorem), automata, parity games, model-checking, logic, monads, Haskell, ...

Projects

Resource Aware ML

Publications

Theses

• Jan Hoffmann. Resolution Proofs and DLL-Algorithms with Clause Learning. Diploma Thesis. 2007.
  
  pdf (A4 paper); pdf (letter paper); BibTex
• Jan Hoffmann. Weak Parity Games and Language Containment of Weak Alternating Parity Automata. Project Work. 2006.
  
  pdf

Articles

• Jan Hoffmann, Martin Hofmann. Amortized Resource Analysis with Polynomial Potential - A Static Inference of Polynomial Bounds for Functional Programs In Proceedings of the 19th European Symposium on Programming (ESOP'10). 2010 (to appear).
  
  pdf (extended version); pdf (conference version); BibTex
• Felix Brandt, Markus Brill, Felix Fischer, Paul Harrenstein, and Jan Hoffmann. Computing Shapley's saddles. ACM SIGecom Exchanges, 8(2). 2009 (to appear).
  
  pdf
• Dorothea Baumeister, Felix Brandt, Felix Fischer, Jan Hoffmann, Jörg Rothe. The Complexity of Computing Minimal Unidirectional Covering Sets. Technical report. 2009.
  
  pdf; link
• Felix Brandt, Markus Brill, Felix Fischer, Jan Hoffmann. The Computational Complexity of Weak Saddles. In Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), volume 5814 of Lecture Notes in Computer Science (LNCS), pages 238–249. 2009.
  
  pdf; BibTex
• Jan Hoffmann. Finding a Tree Structure in a Resolution Proof is NP-complete. Theoretical Computer Science 410, 2295-2300. 2009.
  
  pdf; BibTex
• Samuel R. Buss, Jan Hoffmann, Jan Johannsen. Resolution Trees with Lemmas - Resolution Refinements that Characterize DLL-Algorithms with Clause Learning. Logical Methods in Computer Science Vol. 4 (4:13) 2008.
  
  pdf; BibTex
• Samuel R. Buss, Jan Hoffmann. The NP-hardness of finding a directed acyclic graph for regular resolution. Theoretical Computer Science 396, 271-276. 2008.
  pdf; BibTex

Erdös Number

My Erdös number is 3 due to the path JH - Samuel R. Buss - Shlomo Moran - PE.

Teaching

Assistant

• WS 08/09 Komplexitätstheorie (Martin Hofmann)
• WS 07/08 Repetitorium Informatik 1 (Jan Johannsen)

Tutor

• SS 06 Informatik IV (François Bry)
• SS 06 Effiziente Algorithmen (Martin Hofmann)
• SS 05 Informatik IV (Martin Hofmann)
• WS 04/05 Lineare Algebra (Helmut Schwichtenberg)
• WS 03/04 Diskrete Strukturen (Oliver Deiser)

Author: Jan Hoffmann Last modified: Wed Dec 30 15:25:02 CET 2009