László Babai

University of Chicago — United States

Mathematics · Physical Sciences

58h-index14.9kcitations217works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Finite Group Theory Research(83), Coding theory and cryptography(61), graph theory and CDMA systems(55), Advanced Graph Theory Research(48), Complexity and Algorithms in Graphs(38)

Publications217 total

Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed
Journal of Algebra·2021Open Access
Asymmetric coloring of locally finite graphs and profinite permutation\n groups: Tucker's Conjecture confirmed
arXiv (Cornell University)·2021Open Access
Weights of exact threshold functions
Izvestiya Mathematics·2021
Matrix Rigidity Depends on the Target Field
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2021· 2 citedOpen Access
Веса точных пороговых функций
Известия Российской академии наук Серия математическая·2021
Canonical form for graphs in quasipolynomial time: preliminary report
2019· 27 cited
GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM
Proceedings of the International Congress of Mathematicians (ICM 2018)·2019· 25 cited
List-Decoding Homomorphism Codes with Arbitrary Codomains
arXiv (Cornell University)·2018Open Access
List-Decoding Homomorphism Codes with Arbitrary Codomains
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2018· 1 citedOpen Access
The Model-Theoretic Expressiveness of Propositional Proof Systems
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2017· 94 citedOpen Access
Graph isomorphism in quasipolynomial time [extended abstract]
2016· 399 cited
The Graph Isomorphism Problem (Dagstuhl Seminar 15511)
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)·2016· 11 citedOpen Access
Graph Isomorphism in Quasipolynomial Time
arXiv (Cornell University)·2015· 281 citedOpen Access
Asymptotic Delsarte cliques in distance-regular graphs
Journal of Algebraic Combinatorics·2015· 1 citedOpen Access
On the automorphism groups of strongly regular graphs II
Journal of Algebra·2014· 16 cited
Most primitive groups are full automorphism groups of edge-transitive hypergraphs
Journal of Algebra·2014· 9 citedOpen Access
On the automorphism groups of strongly regular graphs I
2014· 16 cited
Element order versus minimal degree in permutation groups: an old lemma with new applications
arXiv (Cornell University)·2014· 2 citedOpen Access
Faster Canonical Forms for Strongly Regular Graphs
2013· 23 cited
A polynomial-time theory of black box groups I
Cambridge University Press eBooks·2013· 61 cited
page 1 of 11Next →

Frequent Co-authors

Lance Fortnow(6), Eugene M. Luks(4), Ákos Seress(4), Carsten Lund(3), Noga Alon(2), Márió Szegedy(2), Sanjeev Arora(2), Jacques Stern(2), Z. Sweedyk(2), Péter Frankl(2), Janoš Šimon(2), Noam Nisan(2), Avi Wigderson(2), William M. Kantor(2), Anna Gál(2), Peter G. Kimmel(2), Alon Itai(1), Leonid A. Levin(1), Shlomo Moran(1), Paul Erdo ̋s(1)