Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Austrin, Per"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Subset sum in the absence of concentration
Per Austrin
,
Petteri Kaski
,
Mikko Koivisto
,
Jesper Nederlof
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 48-61
Space-time tradeoffs for subset sum: An improved worst case algorithm
Per Austrin
,
Petteri Kaski
,
Mikko Koivisto
,
Jussi Määttä
Lecture Notes in Computer Science
7965
, 2013, pp. 45-56
Randomly supported independence and resistance
Per Austrin
,
Johan Håstad
SIAM Journal on Computing
40
(1), 2011, pp. 1-27
A simple deterministic reduction for the gap minimum distance of code problem
Per Austrin
,
Subhash Khot
Lecture Notes in Computer Science
6755
, 2011, pp. 474-485
On quadratic threshold CSPs
Per Austrin
,
Siavosh Benabbas
,
Avner Magen
Lecture Notes in Computer Science
6034
, 2010, pp. 332-343
Towards sharp inapproximability for any 2-CSP
Per Austrin
SIAM Journal on Computing
39
(6), 2010, pp. 2430-2463
Randomly supported independence and resistance
Per Austrin
,
Johan Håstad
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 483-492
Balanced Max 2-Sat might not be the hardest
Per Austrin
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 189-197