World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
65
Citations
19169
World Ranking
2436
National Ranking
1220

Mathematics

D-Index
65
Citations
18940
World Ranking
386
National Ranking
206

Research.com Recognitions

  • 2015 - Fellow of the American Academy of Arts and Sciences

Overview

László Babai is affiliated with the University of Chicago in the United States. Their research primarily focuses on areas within Computer Science, with notable contributions to the subfields of Computational Theory and Mathematics, Electrical and Electronic Engineering, Computer Vision and Pattern Recognition, and Discrete Mathematics and Combinatorics.

The main topics addressed in their work include:

  • Advanced Graph Theory Research
  • Graph theory and CDMA systems
  • Matrix Theory and Algorithms
  • Polynomial and algebraic computation
  • Digital Image Processing Techniques
  • Graph Labeling and Dimension Problems
  • Limits and Structures in Graph Theory

Recent publications by László Babai illustrate the diversity of their research interests and include the following:

  • "Matrix Rigidity Depends on the Target Field", 2021, published in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Weights of exact threshold functions", 2021, published in Izvestiya Mathematics
  • "Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed", 2021, Journal of Algebra
  • "Веса точных пороговых функций", 2021, Известия Российской академии наук Серия математическая
  • "Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed", 2021, arXiv (Cornell University)

Frequent co-authors collaborating with László Babai include:

  • Kristoffer Arnsfelt Hansen
  • Vladimir V. Podolskii
  • Xiaoming Sun
  • Bohdan Kivva

Their work has been disseminated across a range of publication venues, among which are:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Izvestiya Mathematics
  • Journal of Algebra
  • Известия Российской академии наук Серия математическая
  • arXiv (Cornell University)

In recognition of their contributions to the field, László Babai was named a Fellow of the American Academy of Arts and Sciences in 2015.

Best Publications

  • On Lova´sz' lattice reduction and the nearest lattice point problem

    L Babai;L Babai

  • Trading group theory for randomness

    L Babai

  • Non-deterministic exponential time has two-prover interactive protocols

    L. Babai;L. Babai;L. Fortnow;C. Lund

  • A fast and simple randomized parallel algorithm for the maximal independent set problem

    Noga Alon;Noga Alon;Laszlo Babai;Laszlo Babai;Alon Itai;Alon Itai

  • Checking computations in polylogarithmic time

    László Babai;Lance Fortnow;Leonid A. Levin;Mario Szegedy

  • Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class

    László Babai;Shlomo Moran

  • Canonical labeling of graphs

    László Babai;Eugene M. Luks

  • Non-deterministic exponential time has two-prover interactive protocols

    Unknown

  • Graph Isomorphism in Quasipolynomial Time

    László Babai

  • Graph isomorphism in quasipolynomial time [extended abstract]

    László Babai

  • Complexity classes in communication complexity theory

    Laszlo Babai;Peter Frankl;Janos Simon

  • BPP has subexponential time simulations unless EXPTIME has publishable proofs

    László Babai;Lance Fortnow;Noam Nisan;Avi Wigderson

  • Random Graph Isomorphism

    László Babai;Paul Erdo˝s;Stanley M. Selkow

  • Automorphism groups, isomorphism, reconstruction

    László Babai

  • Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

    L. Babai;N. Nisan;M. Szegedy

  • Spectra of Cayley graphs

    László Babai

  • On The Complexity Of Matrix Group Problems I

    L. Babai;E. Szemeredi

  • Nondeterministic exponential time has two-prover interactive protocols

    L. Babai;L. Fortnow;C. Lund

  • The hardness of approximate optima in lattices, codes, and systems of linear equations

    S. Arora;L. Babai;J. Stern;Z. Sweedyk

  • Isomorphism problem for a class of point-symmetric structures

    L. Babai

  • Isomorphism of graphs with bounded eigenvalue multiplicity

    László Babai;D. Yu. Grigoryev;David M. Mount

  • Communication Complexity

    László Babai

Frequent Co-Authors

Lance Fortnow
Lance Fortnow Illinois Institute of Technology
Peter Frankl
Peter Frankl Alfréd Rényi Institute of Mathematics
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Mario Szegedy
Mario Szegedy Rutgers, The State University of New Jersey
William M. Kantor
William M. Kantor University of Oregon
Peter J. Cameron
Peter J. Cameron University of St Andrews
Avi Wigderson
Avi Wigderson Institute for Advanced Study
Noga Alon
Noga Alon Tel Aviv University
Joel Spencer
Joel Spencer Courant Institute of Mathematical Sciences
Paul Erdös
Paul Erdös Hungarian Academy of Sciences

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to a variety of interdisciplinary online degrees that complement strong analytical skills. For those interested in leveraging quantitative expertise, pursuing a master in data analytics can be an excellent choice. This path focuses on interpreting complex data sets and is increasingly valuable across industries.

Alternatively, some math graduates may opt to expand their business knowledge through MBA programs. For individuals concerned about admission competitiveness, exploring the easy MBA programs to get into provides an accessible route to advance careers without intensive entry barriers.

Those seeking to balance speed and convenience can benefit from the easiest and fastest online MBA programs. These programs often combine flexible schedules with accelerated formats, making them ideal for working professionals.

For a more specialized leadership role in business, online doctoral programs are also available. Considering the cheapest online DBA programs can make pursuing a Doctorate in Business Administration financially feasible while enhancing advanced management skills.

Best Scientists Citing László Babai

Trending Scientists

Recently Published Articles