Per Austrin

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 Subhash Khot

> Home > Persons > Per Austrin

Publications

2014
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/tit/AustrinK14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/AustrinK14
Per Austrin, Subhash Khot:
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. IEEE Trans. Inf. Theory 60(10): 6636-6645 (2014)
2013
[c16]
- view
  authority control:
- export record
  dblp key:
  - conf/innovations/AustrinK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/innovations/AustrinK13
Per Austrin, Subhash Khot:
A characterization of approximation resistance for even k-partite CSPs. ITCS 2013: 187-196
[i16]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1301-2731
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1301-2731
Per Austrin, Subhash Khot:
A Characterization of Approximation Resistance for Even $k$-Partite CSPs. CoRR abs/1301.2731 (2013)
2011
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/toc/AustrinKS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/toc/AustrinKS11
Per Austrin, Subhash Khot, Muli Safra:
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. Theory Comput. 7(1): 27-43 (2011)
[c9]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/AustrinK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AustrinK11
Per Austrin, Subhash Khot:
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. ICALP (1) 2011: 474-485
2010
[i4]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1010-1481
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1010-1481
Per Austrin, Subhash Khot:
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. CoRR abs/1010.1481 (2010)
2009
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/AustrinKS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/AustrinKS09
Per Austrin, Subhash Khot, Muli Safra:
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. CCC 2009: 74-80

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.