Hartmut Klauck

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 Dirk Oliver Theis

> Home > Persons > Hartmut Klauck

Publications

2015
[i25]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/KlauckLTT15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/KlauckLTT15
Hartmut Klauck, Troy Lee, Dirk Oliver Theis, Rekha R. Thomas:
Limitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082). Dagstuhl Reports 5(2): 109-127 (2015)
2013
[i21]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1305-4147
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1305-4147
LeRoy Beasely, Troy Lee, Hartmut Klauck, Dirk Oliver Theis:
Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices. CoRR abs/1305.4147 (2013)
[i19]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dagstuhl-reports/BeasleyKLT13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dagstuhl-reports/BeasleyKLT13
LeRoy B. Beasley, Hartmut Klauck, Troy Lee, Dirk Oliver Theis:
Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082). Dagstuhl Reports 3(2): 127-143 (2013)

a service of

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.