|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 13 publication records. Showing 13 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Neelakantan R. Krishnaswami, Nick Benton, Jan Hoffmann 0002 |
Higher-order functional reactive programming in bounded space.  |
POPL  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002 |
The Computational Complexity of Weak Saddles. |
Theory Comput. Syst. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Hoffmann 0002, Klaus Aehlig, Martin Hofmann |
Multivariate amortized resource analysis. |
POPL |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Hoffmann 0002 |
An Automatic Amortized Analysis of the Resource Consumption of Functional Programs. |
AlgoSyn |
2010 |
DBLP BibTeX RDF |
|
| 1 | Jan Hoffmann 0002, Martin Hofmann |
Amortized Resource Analysis with Polymorphic Recursion and Partial Big-Step Operational Semantics. |
APLAS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Hoffmann 0002, Martin Hofmann |
Amortized Resource Analysis with Polynomial Potential. |
ESOP |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Dorothea Baumeister, Felix Brandt, Felix A. Fischer, Jan Hoffmann 0002, Jörg Rothe |
The Complexity of Computing Minimal Unidirectional Covering Sets. |
CIAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jan Hoffmann 0002 |
Finding a tree structure in a resolution proof is NP-complete. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Brandt, Markus Brill, Felix A. Fischer, Paul Harrenstein, Jan Hoffmann 0002 |
Computing Shapley's saddles. |
SIGecom Exchanges |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Felix Brandt, Markus Brill, Felix A. Fischer, Jan Hoffmann 0002 |
The Computational Complexity of Weak Saddles. |
SAGT |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jan Hoffmann 0002 |
The NP-hardness of finding a directed acyclic graph for regular resolution. |
Theor. Comput. Sci. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen |
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning. |
Logical Methods in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Samuel R. Buss, Jan Hoffmann 0002, Jan Johannsen |
Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning |
CoRR |
2008 |
DBLP BibTeX RDF |
|
Displaying result #1 - #13 of 13 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")