Per Austrin

2.2k total citations · 1 hit paper
33 papers, 1.1k citations indexed

About

Per Austrin is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Per Austrin has authored 33 papers receiving a total of 1.1k indexed citations (citations by other indexed papers that have themselves been cited), including 29 papers in Computational Theory and Mathematics, 11 papers in Artificial Intelligence and 5 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Per Austrin's work include Complexity and Algorithms in Graphs (25 papers), Advanced Graph Theory Research (19 papers) and Machine Learning and Algorithms (5 papers). Per Austrin is often cited by papers focused on Complexity and Algorithms in Graphs (25 papers), Advanced Graph Theory Research (19 papers) and Machine Learning and Algorithms (5 papers). Per Austrin collaborates with scholars based in Sweden, United States and Canada. Per Austrin's co-authors include Elchanan Mossel, Johan Håstad, Subhash Khot, Muli Safra, Venkatesan Guruswami, Konstantinos Georgiou, Siavosh Benabbas, Eden Chlamtáč, Yuhuai Wu and Mikko Koivisto and has published in prestigious journals such as SHILAP Revista de lepidopterología, IEEE Transactions on Information Theory and SIAM Journal on Computing.

In The Last Decade

Per Austrin

28 papers receiving 1.0k citations

Hit Papers

align trajectories

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Towards Sharp Inapproximability For Any 2-CSP

2007 783 citations Per Austrin profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Per Austrin Sweden	12	808	283	220	207	133	33	1.1k
Sofya Raskhodnikova United States	15	1.6k 2.0×	487 1.7×	428 1.9×	305 1.5×	237 1.8×	52	1.8k
Jonathan Ullman United States	15	588 0.7×	113 0.4×	122 0.6×	66 0.3×	93 0.7×	47	749
Alexandre Evfimievski United States	12	1.7k 2.1×	105 0.4×	385 1.8×	135 0.7×	265 2.0×	25	2.0k
Vibhor Rastogi United States	16	1.4k 1.8×	83 0.3×	355 1.6×	433 2.1×	202 1.5×	25	1.7k
Dilys Thomas United States	10	773 1.0×	45 0.2×	213 1.0×	84 0.4×	462 3.5×	20	1.1k
Mukund Sundararajan United States	10	429 0.5×	34 0.1×	103 0.5×	88 0.4×	89 0.7×	13	539
Catuscia Palamidessi France	22	1.4k 1.7×	770 2.7×	171 0.8×	89 0.4×	363 2.7×	142	1.7k
Ljiljana Branković Australia	14	248 0.3×	132 0.5×	91 0.4×	9 0.0×	105 0.8×	56	658
Michael Hay United States	21	2.1k 2.6×	91 0.3×	832 3.8×	421 2.0×	175 1.3×	37	2.3k

Countries citing papers authored by Per Austrin

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Per Austrin

This figure shows the co-authorship network connecting the top 25 collaborators of Per Austrin. A scholar is included among the top collaborators of Per Austrin based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Per Austrin. Per Austrin is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Austrin, Per, et al.. (2023). Optimal Inapproximability with Universal Factor Graphs. ACM Transactions on Algorithms. 21(3). 1–39. 1 indexed citations

2.

Austrin, Per, et al.. (2022). Perfect Matching in Random Graphs is as Hard as Tseitin. SHILAP Revista de lepidopterología. Volume 1.

3.

Austrin, Per, et al.. (2019). Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

4.

Austrin, Per, Petteri Kaski, Mikko Koivisto, & Jesper Nederlof. (2017). Sharper Upper Bounds for Unbalanced Uniquely Decodable Code Pairs. IEEE Transactions on Information Theory. 64(2). 1368–1373. 5 indexed citations

5.

Austrin, Per, Kai-Min Chung, Mohammad Mahmoody, Rafael Pass, & Karn Seth. (2016). On the Impossibility of Cryptography with Tamperable Randomness. Algorithmica. 79(4). 1052–1101. 4 indexed citations

6.

Austrin, Per, Siavosh Benabbas, & Konstantinos Georgiou. (2016). Better Balance by Being Biased. ACM Transactions on Algorithms. 13(1). 1–27. 13 indexed citations

7.

Austrin, Per, Petteri Kaski, Mikko Koivisto, & Jesper Nederlof. (2016). Sharper upper bounds for unbalanced Uniquely Decodable Code Pairs. TU/e Research Portal. 335–339. 3 indexed citations

8.

Austrin, Per, et al.. (2015). . Theory of Computing. 11(1). 257–283. 2 indexed citations

9.

Austrin, Per. (2015). (2+ε)-SAT is NP-hard. Open Collections. 1 indexed citations

10.

Austrin, Per, Petteri Kaski, Mikko Koivisto, & Jesper Nederlof. (2015). Subset Sum in the Absence of Concentration. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 5 indexed citations

11.

Austrin, Per, Mark Braverman, & Eden Chlamtáč. (2013). . Theory of Computing. 9(1). 117–142. 10 indexed citations

12.

Austrin, Per & Subhash Khot. (2013). A characterization of approximation resistance for even k-partite CSPs. 187–196. 2 indexed citations

13.

Austrin, Per & Johan Håstad. (2012). On the Usefulness of Predicates. 53–63. 6 indexed citations

14.

Austrin, Per, Subhash Khot, & Muli Safra. (2011). . Theory of Computing. 7(1). 27–43. 23 indexed citations

15.

Austrin, Per & Elchanan Mossel. (2011). Noise correlation bounds for uniform low degree functions. Arkiv för matematik. 51(1). 29–52. 1 indexed citations

16.

Austrin, Per, Subhash Khot, & Muli Safra. (2009). Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs. 74–80. 21 indexed citations

17.

Austrin, Per & Elchanan Mossel. (2009). Approximation Resistant Predicates from Pairwise Independence. Computational Complexity. 18(2). 249–271. 43 indexed citations

18.

Austrin, Per. (2007). Towards Sharp Inapproximability For Any 2-CSP. 307–317. 16 indexed citations

19.

Austrin, Per. (2007). Towards Sharp Inapproximability For Any 2-CSP. 307–317. 783 indexed citations breakdown →

20.

Austrin, Per. (2007). Towards Sharp Inapproximability For Any 2-CSP. 2 indexed citations

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.

Explore authors with similar magnitude of impact