Per Austrin
Impact in
-
- Mobile Crowdsensing and Crowdsourcing
- Artificial Intelligence top 2%
- Privacy-Preserving Technologies in Data
- Cryptography and Data Security
- Stochastic Gradient Optimization Techniques
- Internet Traffic Analysis and Secure E-voting
Papers in
-
- Complexity and Algorithms in Graphs 25
- Advanced Graph Theory Research 19
-
- Machine Learning and Algorithms 5
- Cryptography and Data Security 3
- Coding theory and cryptography 2
- Co-authors
- Elchanan Mossel (3 shared papers)Johan Håstad (8 shared papers)Subhash Khot (4 shared papers)Muli Safra (2 shared papers)Venkatesan Guruswami (2 shared papers)Siavosh Benabbas (2 shared papers)Konstantinos Georgiou (1 shared paper)Mikko Koivisto (3 shared papers)
- Journals
- Theory of Computing (3 papers)SIAM Journal on Computing (3 papers)ACM Transactions on Algorithms (2 papers)IEEE Transactions on Information Theory (2 papers)Algorithmica (1 paper)
- Partner nations
- SwedenUnited StatesCanada
In The Last Decade
Per Austrin
28 papers receiving 1.0k citations
Per Austrin's Hit Papers
Peers
Comparison fields: 5 of 56
- Computer Science Applications 207
- Artificial Intelligence 808
- Computational Theory and Mathematics 283
- Computer Graphics and Computer-Aided Design 49
- Management Science and Operations Research 108
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 23 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 33 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 | 783 |
| 2 | 2009 | 43 | |
| 3 | 2011 | 23 | |
| 4 | 2008 | 22 | |
| 5 | 2009 | 21 | |
| 6 | 2017 | 20 | |
| 7 | 2011 | 18 | |
| 8 | 2007 | 16 | |
| 9 | 2010 | 16 | |
| 10 | 2013 | 16 | |
| 11 | 2016 | 13 | |
| 12 | 2014 | 11 | |
| 13 | 2013 | 10 | |
| 14 | 2012 | 6 | |
| 15 | 2009 | 6 | |
| 16 | 2017 | 5 | |
| 17 | 2015 | 5 | |
| 18 | Conditional Inapproximability and Limited Independence | 2008 | 5 |
| 19 | 2014 | 5 | |
| 20 | 2016 | 4 |
About Per Austrin
Per Austrin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 33 papers that have together received 1.1k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (25 papers), Advanced Graph Theory Research (19 papers), Machine Learning and Algorithms (5 papers), Limits and Structures in Graph Theory (5 papers), Computational Geometry and Mesh Generation (5 papers), Cryptography and Data Security (3 papers), Optimization and Packing Problems (2 papers) and Coding theory and cryptography (2 papers). The work is most often cited by research in Computer Science Applications (207 citations), Artificial Intelligence (808 citations), Computational Theory and Mathematics (283 citations), Computer Graphics and Computer-Aided Design (49 citations) and Management Science and Operations Research (108 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, Siavosh Benabbas, Konstantinos Georgiou, Mikko Koivisto, Jesper Nederlof and Petteri Kaski. Their work appears in journals such as Theory of Computing, SIAM Journal on Computing, ACM Transactions on Algorithms, IEEE Transactions on Information Theory and Algorithmica.
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.