Thore Husfeldt

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Gregory B. Sorkin

> Home > Persons > Thore Husfeldt

Publications

2013
[i15]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/HusfeldtPSW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/HusfeldtPSW13
Thore Husfeldt, Ramamohan Paturi, Gregory B. Sorkin, Ryan Williams:
Exponential Algorithms: Algorithms and Complexity Beyond Polynomial Time (Dagstuhl Seminar 13331). Dagstuhl Reports 3(8): 40-72 (2013)
2010
[e1]
- view
- export record
  dblp key:
  - conf/dagstuhl/2010P10441
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/2010P10441
Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
Exact Complexity of NP-hard Problems, 31.10. - 05.11.2010. Dagstuhl Seminar Proceedings 10441, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2010 [contents]
[i12]
- view
  - electronic edition @ dagstuhl.de (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/dagstuhl/HusfeldtKPS10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dagstuhl/HusfeldtKPS10
Thore Husfeldt, Dieter Kratsch, Ramamohan Paturi, Gregory B. Sorkin:
10441 Abstracts Collection - Exact Complexity of NP-hard Problems. Exact Complexity of NP-hard Problems 2010

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.