László Babai - Concepedia

Author

László Babai

Also Known As

Babai, L, Babai, Laszlo, Babai, László, Grädel, Erich, L Babai, László Babai, L. Babai, L?szl� Babai, Laszlo Babai, LÁSZLÓ BABAI

217

Publications

14.9K

Citations

H-Index

Concepts

All Affiliations

University of Chicago Eötvös Loránd University Hungarian Academy of Sciences University of Oregon University of Illinois Chicago

About

László Babai is an author at University of Chicago specializing in discrete mathematics, engineering, and computational complexity.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	36	62	8.8K
2	Education	28	40	3.6K
3	Communication	6	6	620
4	Business	5	5	1.7K
5	Arts	1	1	35

László Babai

130

Publications

13.4K

Citations

H-Index

Page 1

	Year	Citations
On Lovász’ lattice reduction and the nearest lattice point problem László Babai COMBINATORICA Discrete GeometryEngineeringLattice (Order)Computational ComplexityDiscrete Mathematics	1986	917
A fast and simple randomized parallel algorithm for the maximal independent set problem Noga Alon, László Babai, Alon Itai Journal of Algorithms Mathematical ProgrammingEngineeringParallel Complexity TheoryRandomized AlgorithmCombinatorial Problem	1986	834
Trading group theory for randomness László Babai Game TheoryFrattini SubgroupEducationMatriz GroupsFinite Simple Groups	1985	775
Checking computations in polylogarithmic time László Babai, Lance Fortnow, Leonid A. Levin, Computational Complexity TheoryEngineeringVerificationComputer-aided VerificationComputational Complexity	1991	617
Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes László Babai, Shlomo Moran Journal of Computer and System Sciences EngineeringComplexity ClassesCombinatorial GameGame TheoryComputational Complexity	1988	589
Non-deterministic exponential time has two-prover interactive protocols László Babai, Lance Fortnow, Carsten Lund Computational Complexity EngineeringProof ComplexityVerificationFormal MethodsNon-deterministic Exponential Time	1992	528
Non-deterministic exponential time has two-prover interactive protocols László Babai, Lance Fortnow, Carsten Lund Computational Complexity EngineeringProof ComplexityVerificationFormal MethodsNon-deterministic Exponential Time	1991	455
Canonical labeling of graphs László Babai, Eugene M. Luks EngineeringGraph TheoryData ScienceAlgebraic Graph TheoryStructural Graph Theory	1983	412
Graph isomorphism in quasipolynomial time [extended abstract] László Babai	2016	398
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations Sanjeev Arora, László Babai, Jacques Stern, Journal of Computer and System Sciences Mathematical ProgrammingComputational Complexity TheoryEngineeringApproximate OptimaAlgorithmic Information Theory	1997	339

Page 1