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