László Babai (English Wikipedia)

Babai, László (2016), "Graph Isomorphism in Quasipolynomial Time [Extended Abstract]", Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC '16), New York, NY, USA: ACM, pp. 684–697, arXiv:1512.03547, doi:10.1145/2897518.2897542, ISBN 978-1-4503-4132-5, S2CID 17118954

books.google.com

Definition 2.3. String Isomorphism, in: Transactions on Computational Science V. Special Issue on Cognitive Knowledge Representation. Editors-in-Chief: Marina L. Gavrilova, C. J. Kenneth Tan. Editors: Yingxu Wang, Keith Chan] / Lecture Notes in Computer Science / Volume 5540, Springer Verlag, 2009

Babai, László; Moran, Shlomo (1988), "Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class", J. Comput. Syst. Sci., 36 (2): 254–276, doi:10.1016/0022-0000(88)90028-1.
Cho, Adrian (November 10, 2015), "Mathematician claims breakthrough in complexity theory", Science, doi:10.1126/science.aad7416
Babai, László (2016), "Graph Isomorphism in Quasipolynomial Time [Extended Abstract]", Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC '16), New York, NY, USA: ACM, pp. 684–697, arXiv:1512.03547, doi:10.1145/2897518.2897542, ISBN 978-1-4503-4132-5, S2CID 17118954

Klarreich, Erica (14 December 2015). "Landmark Algorithm Breaks 30-Year Impasse". Quanta Magazine. Archived from the original on 2016-01-21.

Babai, László (2016), "Graph Isomorphism in Quasipolynomial Time [Extended Abstract]", Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing (STOC '16), New York, NY, USA: ACM, pp. 684–697, arXiv:1512.03547, doi:10.1145/2897518.2897542, ISBN 978-1-4503-4132-5, S2CID 17118954

Definition 2.3. String Isomorphism, in: Transactions on Computational Science V. Special Issue on Cognitive Knowledge Representation. Editors-in-Chief: Marina L. Gavrilova, C. J. Kenneth Tan. Editors: Yingxu Wang, Keith Chan] / Lecture Notes in Computer Science / Volume 5540, Springer Verlag, 2009

Complexity of the coset intersection problem // Theoretical Computer Science Stack Exchange, asked Sep 25 2014 at 9:43

Claimed Breakthrough Slays Classic Computing Problem Archived 2016-01-22 at the Wayback Machine // MIT Technology Review, by Tom Simonite on November 13, 2015

Babai, László (1979), Monte-Carlo algorithms in graph isomorphism testing (PDF), Tech. Report, Université de Montréal.
László Babai: Fixing the UPCC case of Split-or-Johnson, posted on 14 January 2017

Curriculum vitae from Babai's web site, retrieved 2016-01-28.
Klarreich, Erica (14 December 2015). "Landmark Algorithm Breaks 30-Year Impasse". Quanta Magazine. Archived from the original on 2016-01-21.
Claimed Breakthrough Slays Classic Computing Problem Archived 2016-01-22 at the Wayback Machine // MIT Technology Review, by Tom Simonite on November 13, 2015
1993 Gödel Prize Archived 2015-12-08 at the Wayback Machine, ACM SIGACT, retrieved 2010-08-14.