@unpublished{HoffmannMZ12,
  author  = {Jan Hoffmann and Michael Marmar and Zhong Shao},
  title = {{Quantitative Reasoning for Proving Lock-Freedom of Non-Blocking Data Structures}},
  note = {Submitted Manuscript},
  year = 2012

}

@article{BaumeisterBFHR12,
  author    = {Dorothea Baumeister and
               Felix Brandt and
               Felix A. Fischer and
               Jan Hoffmann and
               J{\"o}rg Rothe},
  title     = {{The Complexity of Computing Minimal Unidirectional Covering
               Sets}},
  journal = {Theory of Computing Systems},
  year      = {2012}, 
  note      = {In Press}
}   pages     = {299-310},



@inproceedings{HoffmannAH12a,
  author    = {Jan Hoffmann and
               Klaus Aehlig and
               Martin Hofmann},
  title     = {{Resource Aware ML}},
  booktitle = {{24rd International Conference on Computer Aided
                  Verification (CAV'12)}},
  year      = {2012},
}



@article{HoffmannAH12,
  author    = {Jan Hoffmann and
               Klaus Aehlig and
               Martin Hofmann},
  title     = {{Multivariate Amortized Resource Analysis}},
  journal   = {ACM Trans. Program. Lang. Syst.},
  year      = 2012
}


@inproceedings{NNH12,
   author    = {Neelakantan R. Krishnaswami and
                Nick Benton and
                Jan Hoffmann},
   title     = {{Higher-Order Functional Reactive Programming in Bounded Space}},
   booktitle = {39th Symposium on Principles of Programming Languages (POPL'12)},
   year      = {2012},
}

@phdthesis{Hoffmann11,
  author = {Jan Hoffmann},
  title = {{Types with Potential: Polynomial Resource Bounds via Automatic Amortized Analysis}},
  school = {Ludwig-Maximilians-Universi{\"a}t M{\"u}nchen},
  year =  2011
}

@inproceedings{HoffmannAH10,
  author    = {Jan Hoffmann and
               Klaus Aehlig and
               Martin Hofmann},
  title     = {{Multivariate Amortized Resource Analysis}},
  booktitle = {38th Symposium on Principles of Programming Languages (POPL'11)},
  year      = 2011
}

@inproceedings{HoffmannH102,
  author    = {Jan Hoffmann and
               Martin Hofmann},
  title     = {{Amortized Resource Analysis with Polymorphic Recursion
                  and Partial Big-Step Operational Semantics}},
  booktitle =  {8th Asian Symposium on Programming Languages (APLAS'10)},
  year      = {2010}
}

@inproceedings{HoffmannH10,
  author    = {Jan Hoffmann and
               Martin Hofmann},
  title     = {{Amortized Resource Analysis with Polynomial Potential}},
  booktitle = {19th European Symposium on Programming (ESOP'10)},
  year      = {2010},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}   pages     = {287-306},



@inproceedings{BaumeisterBFHR10,
  author    = {Dorothea Baumeister and
               Felix Brandt and
               Felix A. Fischer and
               Jan Hoffmann and
               J{\"o}rg Rothe},
  title     = {{The Complexity of Computing Minimal Unidirectional Covering
               Sets}},
  booktitle = {Algorithms and Complexity, 7th International Conference (CIAC'10)},
  year      = {2010}, 
  bibsource = {DBLP, http://dblp.uni-trier.de}
}   pages     = {299-310},


@article{BrandtBFH10Journal,
  author    = {Felix Brandt and
               Markus Brill and
               Felix A. Fischer and
               Jan Hoffmann},
  Journal   = {Theory of Computing Systems},
   publisher = {Springer New York},
  title     = {{The Computational Complexity of Weak Saddles}},
  year      = 2010
}


@article{BBFHH09a,
 Author = {Felix Brandt and Markus Brill and Felix Fischer and Paul Harrenstein and Jan Hoffmann},
 Journal = {ACM SIGecom Exchanges},
 Title = {{Computing {S}hapley's Saddles}},
 Volume = 8,
 Year = 2009
}

@inproceedings{BrandtBFH09,
  author    = {Felix Brandt and
               Markus Brill and
               Felix A. Fischer and
               Jan Hoffmann},
  title     = {{The Computational Complexity of Weak Saddles}},
  booktitle = {Algorithmic Game Theory, Second International Symposium (SAGT'09)},
  year      = {2009},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}


@article{Hoffmann09,
  author    = {Jan Hoffmann},
  title     = {{Finding a Tree Structure in a Resolution Proof is NP-Complete}},
  journal   = {Theoretical Computer Science},
  volume    = {410},
  number    = {21-23},
  year      = {2009},
  ee        = {http://dx.doi.org/10.1016/j.tcs.2009.02.018},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}  pages     = {2295-2300},



@article{BussHJ08,
  author    = {Samuel R. Buss and
               Jan Hoffmann and
               Jan Johannsen},
  title     = {{Resolution Trees with Lemmas: Resolution Refinements that
               Characterize DLL Algorithms with Clause Learning}},
  journal   = {Logical Methods in Computer Science},
  volume    = {4},
  number    = {4},
  year      = {2008},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{BussH08,
  author    = {Samuel R. Buss and
               Jan Hoffmann},
  title     = {{The NP-hardness of Finding a Directed Acyclic Graph for
               Regular Resolution}},
  journal   = {Theoretical Computer Science},
  volume    = {396},
  number    = {1-3},
  year      = {2008},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}  pages     = {271-276},


@misc{Hoffmann2007,
   author    = {Jan Hoffmann},
   title     = {Resolution Proofs and DLL-Algorithms with Clause Learning.},
   howpublished = {Diploma Thesis, LMU M\"unchen},
   year      = 2007
}

@Unpublished{open-closure-types-2013@long,
  author =       {Gabriel Scherer and Jan Hoffmann},
  title =        {Open Closure Types},
  note =         {Long version, available electronically},
  url = {http://gallium.inria.fr/~scherer/drafts/closures-long.pdf},
}