BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Latvia
1 × Switzerland
2 × USA
Collaborated with:
S.Khot J.Håstad P.Kaski M.Koivisto J.Määttä
Talks about:
determinist (1) algorithm (1) tradeoff (1) independ (1) support (1) problem (1) minimum (1) hardest (1) distanc (1) subset (1)

Person: Per Austrin

DBLP DBLP: Austrin:Per

Contributed to:

ICALP (1) 20132013
ICALP (1) 20112011
STOC 20092009
STOC 20072007

Wrote 4 papers:

ICALP-v1-2013-AustrinKKM #algorithm #set #trade-off
Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm (PA, PK, MK, JM), pp. 45–56.
ICALP-v1-2011-AustrinK #distance #problem #reduction
A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem (PA, SK), pp. 474–485.
STOC-2009-AustrinH #independence
Randomly supported independence and resistance (PA, JH), pp. 483–492.
STOC-2007-Austrin #satisfiability
Balanced max 2-sat might not be the hardest (PA), pp. 189–197.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.