Conference Tracking data-flow with open closure types 2013 • Lecture Notes in Computer Science • 8312 LNCS:710-726 Scherer G, Hoffmann J
Conference Higher-order functional reactive programming in bounded space 2012 • ACM Sigplan Notices • 47(1):45-58 Krishnaswami NR, Benton N, Jan H
Conference Higher-order functional reactive programming in bounded space 2012 • Conference Record of the Annual ACM Symposium on Principles of Programming Languages • 45-58 Krishnaswami NR, Benton N, Hoffmann J
Journal Article Multivariate amortized resource analysis 2012 • ACM Transactions on Programming Languages and Systems • 34(3): Hoffmann J, Aehlig K, Hofmann M
Conference Resource aware ML 2012 • Lecture Notes in Computer Science • 7358 LNCS:781-786 Hoffmann J, Aehlig K, Hofmann M
Conference Multivariate amortized resource analysis 2011 • ACM Sigplan Notices • 46(1):357-369 Hoffmann J, Aehlig K, Hofmann M
Journal Article The Computational Complexity of Weak Saddles 2011 • Theory of Computing Systems • 49(1):139-161 Brandt F, Brill M, Fischer F, Hoffmann J
Conference Amortized resource analysis with polymorphic recursion and partial big-step operational semantics 2010 • Lecture Notes in Computer Science • 6461 LNCS:172-187 Hoffmann J, Hofmann M
Chapter Amortized Resource Analysis with Polynomial Potential 2010 • Lecture Notes in Computer Science • 6012:287-306 Hoffmann J, Hofmann M
Conference Multivariate amortized resource analysis 2010 • Conference Record of the Annual ACM Symposium on Principles of Programming Languages • 357-369 Hoffmann J, Aehlig K, Hofmann M
Conference The complexity of computing minimal unidirectional covering sets 2010 • Lecture Notes in Computer Science • 6078 LNCS:299-310 Baumeister D, Brandt F, Fischer F, Hoffmann J, Rothe J
Journal Article Finding a tree structure in a resolution proof is NP-complete 2009 • Theoretical Computer Science • 410(21-23):2295-2300 Hoffmann J
Conference The computational complexity of weak saddles 2009 • Lecture Notes in Computer Science • 5814 LNCS:238-249 Brandt F, Brill M, Fischer F, Hoffmann J
Journal Article Resolution trees with lemmas: Resolution refinements that characterize DLL algorithms with clause learning 2008 • Logical Methods in Computer Science • 4(4): Buss SR, Hoffmann J, Johannsen J
Journal Article The NP-hardness of finding a directed acyclic graph for regular resolution 2008 • Theoretical Computer Science • 396(1-3):271-276 Buss SR, Hoffmann J
