Per Austrin
Impact in
-
- Mobile Crowdsensing and Crowdsourcing
- Artificial Intelligence top 1%
- Privacy-Preserving Technologies in Data
- Cryptography and Data Security
- Internet Traffic Analysis and Secure E-voting
- Stochastic Gradient Optimization Techniques
Papers in
-
- Complexity and Algorithms in Graphs 33
- Advanced Graph Theory Research 23
- Computability, Logic, AI Algorithms 3
-
- Cryptography and Data Security 8
- Machine Learning and Algorithms 7
- Coding theory and cryptography 3
- Co-authors
- Elchanan Mossel (3 shared papers)Johan Håstad (9 shared papers)Subhash Khot (5 shared papers)Muli Safra (2 shared papers)Siavosh Benabbas (4 shared papers)Toniann Pitassi (2 shared papers)Venkatesan Guruswami (2 shared papers)Konstantinos Georgiou (2 shared papers)
- Journals
- Theory of Computing (4 papers)SIAM Journal on Computing (3 papers)ACM Transactions on Algorithms (2 papers)IEEE Transactions on Information Theory (2 papers)Lecture notes in computer science (10 papers)
- Partner nations
- SwedenUnited StatesCanada
In The Last Decade
Per Austrin
42 papers receiving 1.3k citations
Per Austrin's Hit Papers
Peers
Comparison fields: 5 of 63
- Computer Science Applications 233
- Artificial Intelligence 1.0k
- Computational Theory and Mathematics 415
- Computer Graphics and Computer-Aided Design 67
- Management Science and Operations Research 136
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 25 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 | 916 |
| 2 | 2009 | 58 | |
| 3 | 2009 | 32 | |
| 4 | 2011 | 28 | |
| 5 | 2008 | 27 | |
| 6 | 2017 | 24 | |
| 7 | 2011 | 19 | |
| 8 | 2014 | 19 | |
| 9 | 2007 | 18 | |
| 10 | 2013 | 18 | |
| 11 | 2012 | 18 | |
| 12 | 2010 | 18 | |
| 13 | 2014 | 16 | |
| 14 | 2013 | 14 | |
| 15 | 2016 | 14 | |
| 16 | Better balance by being biased: A 0.8776-approximation for max bisection | 2013 | 13 |
| 17 | 2022 | 11 | |
| 18 | 2009 | 10 | |
| 19 | 2013 | 10 | |
| 20 | 2015 | 9 |
About Per Austrin
Per Austrin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 48 papers that have together received 1.4k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (33 papers), Advanced Graph Theory Research (23 papers), Cryptography and Data Security (8 papers), Machine Learning and Algorithms (7 papers), Computational Geometry and Mesh Generation (6 papers), Limits and Structures in Graph Theory (6 papers), Computability, Logic, AI Algorithms (3 papers) and Coding theory and cryptography (3 papers). The work is most often cited by research in Computer Science Applications (233 citations), Artificial Intelligence (1.0k citations), Computational Theory and Mathematics (415 citations), Computer Graphics and Computer-Aided Design (67 citations) and Management Science and Operations Research (136 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, Siavosh Benabbas, Toniann Pitassi, Venkatesan Guruswami, Konstantinos Georgiou, Mikko Koivisto and Mohammad Mahmoody. Their work appears in journals such as Theory of Computing, SIAM Journal on Computing, ACM Transactions on Algorithms, IEEE Transactions on Information Theory and Lecture notes in computer science.
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.