Per Austrin

	2009
9		Per Austrin, Johan Håstad: Randomly supported independence and resistance. STOC 2009: 483-492
8		Per Austrin, Elchanan Mossel: Approximation Resistant Predicates from Pairwise Independence. Computational Complexity 18(2): 249-271 (2009)
	2008
7		Per Austrin, Gunnar Kreitz: Lower Bounds for Subset Cover Based Broadcast Encryption. AFRICACRYPT 2008: 343-356
6		Per Austrin, Elchanan Mossel: Approximation Resistant Predicates from Pairwise Independence. IEEE Conference on Computational Complexity 2008: 249-258
5		Per Austrin, Elchanan Mossel: Approximation Resistant Predicates From Pairwise Independence CoRR abs/0802.2300: (2008)
4		Per Austrin, Elchanan Mossel: Approximation Resistant Predicates From Pairwise Independence. Electronic Colloquium on Computational Complexity (ECCC) 15(009): (2008)
	2007
3		Per Austrin: Towards Sharp Inapproximability For Any 2-CSP. FOCS 2007: 307-317
2		Per Austrin: Balanced max 2-sat might not be the hardest. STOC 2007: 189-197
	2006
1		Per Austrin: Balanced Max 2-Sat might not be the hardest. Electronic Colloquium on Computational Complexity (ECCC) 13(088): (2006)

Coauthor Index

1	Johan Håstad	[9]
2	Gunnar Kreitz	[7]
3	Elchanan Mossel	[4] [5] [6] [8]

Colors in the list of coauthors