- Home
- Best Scientists - Mathematics
- László Babai

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
62
Citations
17,135
196
World Ranking
329
National Ranking
185

Computer Science
D-index
62
Citations
16,891
189
World Ranking
1844
National Ranking
1008

2015 - Fellow of the American Academy of Arts and Sciences

- Combinatorics
- Discrete mathematics
- Algebra

His main research concerns Discrete mathematics, Combinatorics, Time complexity, Permutation group and Graph isomorphism problem. His research in Discrete mathematics intersects with topics in PH and Group. His work deals with themes such as Random seed and Pseudorandom number generator, which intersect with Combinatorics.

László Babai combines subjects such as Pseudorandom generator, Turing machine, Gas meter prover, Nondeterministic algorithm and Random graph with his study of Time complexity. His studies deal with areas such as Cyclic permutation and Degree as well as Permutation group. His Binary logarithm research incorporates themes from Randomized algorithm, Graph theory, Parallel algorithm and Maximal independent set.

- On Lova´sz' lattice reduction and the nearest lattice point problem (765 citations)
- A fast and simple randomized parallel algorithm for the maximal independent set problem (719 citations)
- A fast and simple randomized parallel algorithm for the maximal independent set problem (719 citations)

His main research concerns Combinatorics, Discrete mathematics, Permutation group, Time complexity and Group. His Combinatorics research includes themes of Classification of finite simple groups and Finite group. His Group theory research extends to Discrete mathematics, which is thematically connected.

His research integrates issues of Degree, Cyclic permutation, Permutation and Algorithm in his study of Permutation group. His Time complexity research is multidisciplinary, incorporating perspectives in Mathematical proof and Turing machine. László Babai has included themes like Pseudorandom generator, Random seed and Pseudorandom number generator in his Turing machine study.

- Combinatorics (90.13%)
- Discrete mathematics (82.51%)
- Permutation group (17.49%)

- Combinatorics (90.13%)
- Discrete mathematics (82.51%)
- Graph isomorphism (8.97%)

László Babai mainly focuses on Combinatorics, Discrete mathematics, Graph isomorphism, Permutation group and Isomorphism. The study incorporates disciplines such as Classification of finite simple groups and Group in addition to Combinatorics. His research on Discrete mathematics often connects related areas such as Group theory.

His Permutation group research includes elements of Conjecture, Graph property, Number theory, Prime number and Riemann hypothesis. His Isomorphism research is multidisciplinary, relying on both Graph theory, Canonical form, Permutation graph and Cyclic permutation. He studied Group isomorphism and Time complexity that intersect with Order isomorphism and Theoretical computer science.

- Graph Isomorphism in Quasipolynomial Time (260 citations)
- Graph isomorphism in quasipolynomial time [extended abstract] (181 citations)
- On the Number of p -Regular Elements in Finite Simple Groups (39 citations)

- Combinatorics
- Algebra
- Discrete mathematics

László Babai mostly deals with Combinatorics, Discrete mathematics, Graph isomorphism, Isomorphism and Classification of finite simple groups. László Babai interconnects Group of Lie type, Order and Permutation group in the investigation of issues within Combinatorics. The various areas that László Babai examines in his Order study include Finite group, Prime factor, Prime, Alternating group and Cayley graph.

László Babai conducted interdisciplinary study in his works that combined Discrete mathematics and Bounded function. His studies in Isomorphism integrate themes in fields like Graph theory and Automorphism. His Graph theory study combines topics from a wide range of disciplines, such as Hypergraph, Computational complexity theory and Rank.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

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

L Babai;L Babai.

Combinatorica **(1986)**

1235 Citations

Trading group theory for randomness

L Babai.

symposium on the theory of computing **(1985)**

1089 Citations

Non-deterministic exponential time has two-prover interactive protocols

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

Computational Complexity **(1992)**

957 Citations

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.

Journal of Algorithms **(1985)**

896 Citations

Checking computations in polylogarithmic time

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

symposium on the theory of computing **(1991)**

747 Citations

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

László Babai;Shlomo Moran.

symposium on the theory of computing **(1988)**

729 Citations

Canonical labeling of graphs

László Babai;Eugene M. Luks.

symposium on the theory of computing **(1983)**

566 Citations

Graph Isomorphism in Quasipolynomial Time

László Babai.

arXiv: Data Structures and Algorithms **(2015)**

489 Citations

Complexity classes in communication complexity theory

Laszlo Babai;Peter Frankl;Janos Simon.

foundations of computer science **(1986)**

443 Citations

BPP has subexponential time simulations unless EXPTIME has publishable proofs

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

Computational Complexity **(1993)**

402 Citations

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

Contact us

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:

Illinois Institute of Technology

Alfréd Rényi Institute of Mathematics

Hebrew University of Jerusalem

Rutgers, The State University of New Jersey

University of Oregon

Institute for Advanced Study

University of St Andrews

Tel Aviv University

Courant Institute of Mathematical Sciences

AT&T (United States)

Tallinn University of Technology

Technical University of Berlin

Stockholm University

University of Bristol

Leibniz-Institut für Festkörper- und Werkstoffforschung Dresden

University of Pavia

Oregon State University

Autonomous University of Barcelona

Rovira i Virgili University

University of Washington

University of Innsbruck

Hebrew University of Jerusalem

Temple University

Pennsylvania State University

Louisiana State University

Washington University in St. Louis

Something went wrong. Please try again later.