| 2026 | SODA | On the Usefulness of Promises. | Per Austrin, Johan Hstad, Bjrn Martinsson |
| 2025 | ICALP | Algorithms for the Diverse-k-SAT Problem: The Geometry of Satisfying Assignments. | Per Austrin, Ioana O. Bercea, Mayank Goswami, Nutan Limaye, Adarsh Srinivasan |
| 2022 | CRYPTO | On the Impossibility of Key Agreements from Quantum Random Oracles. | Per Austrin, Hao Chung, Kai-Min Chung, Shiuan Fu, Yao-Ting Lin, Mohammad Mahmoody |
| 2022 | SODA | Perfect Matching in Random Graphs is as Hard as Tseitin. | Per Austrin, Kilian Risse |
| 2021 | SODA | Optimal Inapproximability with Universal Factor Graphs. | Per Austrin, Jonah Brown-Cohen, Johan Hstad |
| 2020 | SODA | Improved Inapproximability of Rainbow Coloring. | Per Austrin, Amey Bhangale, Aditya Potukuchi |
| 2016 | ISIT | Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2016 | STACS | Dense Subset Sum May Be the Hardest. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2015 | IJCAI | Inapproximability of Treewidth and Related Problems (Extended Abstract). | Yu (Ledell) Wu, Per Austrin, Toniann Pitassi, David Liu |
| 2015 | STACS | Subset Sum in the Absence of Concentration. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jesper Nederlof |
| 2014 | CRYPTO | On the Impossibility of Cryptography with Tamperable Randomness. | Per Austrin, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, Karn Seth |
| 2014 | FOCS | (2 + epsilon)-Sat Is NP-Hard. | Per Austrin, Johan Hstad, Venkatesan Guruswami |
| 2013 | ICALP | Space-Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm. | Per Austrin, Petteri Kaski, Mikko Koivisto, Jussi Mtt |
| 2013 | SODA | Better Balance by Being Biased: A 0.8776-Approximation for Max Bisection. | Per Austrin, Siavosh Benabbas, Konstantinos Georgiou |
| 2011 | ICALP | A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problem. | Per Austrin, Subhash Khot |
| 2010 | LATIN | On Quadratic Threshold CSPs. | Per Austrin, Siavosh Benabbas, Avner Magen |
| 2009 | STOC | Randomly supported independence and resistance. | Per Austrin, Johan Hstad |
| 2007 | FOCS | Towards Sharp Inapproximability For Any 2-CSP. | Per Austrin |
| 2007 | STOC | Balanced max 2-sat might not be the hardest. | Per Austrin |