Jan Hoffmann

Ludwig-Maximilians-Universität München, Germany

other persons with the same name:

• Jan Hoffmann - Humboldt-Universität, Berlin, Germany
• Jan Hoffmann

	2012
13		Neelakantan R. Krishnaswami, Nick Benton, Jan Hoffmann: Higher-order functional reactive programming in bounded space. POPL 2012: 45-58
	2011
12		Jan Hoffmann, Klaus Aehlig, Martin Hofmann: Multivariate amortized resource analysis. POPL 2011: 357-370
11		Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann: The Computational Complexity of Weak Saddles. Theory Comput. Syst. 49(1): 139-161 (2011)
	2010
10		Jan Hoffmann, Martin Hofmann: Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics. APLAS 2010: 172-187
9		Jan Hoffmann: An Automatic Amortized Analysis of the Resource Consumption of Functional Programs. AlgoSyn 2010: 151
8		Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann, Jörg Rothe: The Complexity of Computing Minimal Unidirectional Covering Sets. CIAC 2010: 299-310
7		Jan Hoffmann, Martin Hofmann: Amortized Resource Analysis with Polynomial Potential. ESOP 2010: 287-306
	2009
6		Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann: The Computational Complexity of Weak Saddles. SAGT 2009: 238-249
5		Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann: Computing Shapley's saddles. SIGecom Exchanges 8(2): 3 (2009)
4		Jan Hoffmann: Finding a tree structure in a resolution proof is NP-complete. Theor. Comput. Sci. 410(21-23): 2295-2300 (2009)
	2008
3		Samuel R. Buss, Jan Hoffmann, Jan Johannsen: Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning CoRR abs/0811.1075: (2008)
2		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 4(4): (2008)
1		Samuel R. Buss, Jan Hoffmann: The NP-hardness of finding a directed acyclic graph for regular resolution. Theor. Comput. Sci. 396(1-3): 271-276 (2008)

Coauthor Index

1	Klaus Aehlig	[12]
2	Dorothea Baumeister	[8]
3	Nick Benton (P. N. Benton)	[13]
4	Felix Brandt	[5] [6] [8] [11]
5	Markus Brill	[5] [6] [11]
6	Samuel R. Buss	[1] [2] [3]
7	Felix A. Fischer	[5] [6] [8] [11]
8	Paul Harrenstein	[5]
9	Martin Hofmann	[7] [10] [12]
10	Jan Johannsen	[2] [3]
11	Neelakantan R. Krishnaswami (Neel Krishnaswami)	[13]
12	Jörg Rothe	[8]

Colors in the list of coauthors

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page