Per Austrin
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Artificial Intelligence top 1%
- Privacy-Preserving Technologies in Data
- Cryptography and Data Security
Papers in
-
- Complexity and Algorithms in Graphs 39
- Advanced Graph Theory Research 12
-
- Cryptography and Data Security 6
- Coding theory and cryptography 4
- Quantum Information and Cryptography 1
- Co-authors
- Elchanan Mossel (3 shared papers)Johan Håstad (9 shared papers)Subhash Khot (5 shared papers)Muli Safra (2 shared papers)Venkatesan Guruswami (2 shared papers)Toniann Pitassi (2 shared papers)Siavosh Benabbas (4 shared papers)Konstantinos Georgiou (2 shared papers)
- Journals
- Theory of Computing (4 papers)SIAM Journal on Computing (3 papers)ACM Transactions on Computation Theory (2 papers)IEEE Transactions on Information Theory (2 papers)ACM Transactions on Algorithms (2 papers)
- Partner nations
- SwedenUnited StatesCanada
In The Last Decade
Per Austrin
44 papers receiving 1.5k citations
Per Austrin's Hit Papers
Peers
Comparison fields: 5 of 39
- Computational Theory and Mathematics 486
- Artificial Intelligence 951
- Discrete Mathematics and Combinatorics 34
- Computer Networks and Communications 127
- Management Science and Operations Research 81
Countries citing papers authored by Per Austrin
This map shows the geographic impact of Per Austrin's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Per Austrin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Per Austrin more than expected).
Fields of papers citing papers by Per Austrin
This network shows the impact of papers produced by Per Austrin. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Per Austrin. The network helps show where Per Austrin may publish in the future.
Co-authors
The 24 scholars most cited alongside Per Austrin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 48 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Towards Sharp Inapproximability For Any 2-CSP Hit paper breakdown → | 2007 | 977 |
| 2 | 2009 | 65 | |
| 3 | 2007 | 41 | |
| 4 | 2009 | 41 | |
| 5 | 2017 | 36 | |
| 6 | 2011 | 32 | |
| 7 | 2008 | 29 | |
| 8 | 2011 | 26 | |
| 9 | 2014 | 25 | |
| 10 | 2010 | 21 | |
| 11 | 2013 | 20 | |
| 12 | 2014 | 19 | |
| 13 | 2007 | 17 | |
| 14 | 2012 | 17 | |
| 15 | 2013 | 16 | |
| 16 | 2016 | 16 | |
| 17 | 2019 | 15 | |
| 18 | 2013 | 13 | |
| 19 | 2022 | 13 | |
| 20 | 2009 | 11 |
About Per Austrin
Per Austrin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Computer Networks and Communications and Management Science and Operations Research, having authored 48 papers that have together received 1.6k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (39 papers), Advanced Graph Theory Research (12 papers), Cryptography and Data Security (6 papers), Constraint Satisfaction and Optimization (6 papers), Coding theory and cryptography (4 papers), Limits and Structures in Graph Theory (3 papers), Game Theory and Applications (2 papers) and Quantum Information and Cryptography (1 paper). The work is most often cited by research in Computational Theory and Mathematics (486 citations), Artificial Intelligence (951 citations), Discrete Mathematics and Combinatorics (34 citations), Computer Networks and Communications (127 citations) and Management Science and Operations Research (81 citations). Per Austrin has collaborated with scholars based in Sweden, United States and Canada. Frequent co-authors include Elchanan Mossel, Johan Håstad, Subhash Khot, Muli Safra, Venkatesan Guruswami, Toniann Pitassi, Siavosh Benabbas, Konstantinos Georgiou, Mikko Koivisto and Petteri Kaski. Their work appears in journals such as Theory of Computing, SIAM Journal on Computing, ACM Transactions on Computation Theory, IEEE Transactions on Information Theory and ACM Transactions on Algorithms.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.