| On Lovász’lattice reduction and the nearest lattice point problem L Babai Combinatorica 6 (1), 1-13, 1986 | 1567 | 1986 |
| Trading group theory for randomness L Babai Proceedings of the seventeenth annual ACM symposium on Theory of computing …, 1985 | 1235 | 1985 |
| Graph isomorphism in quasipolynomial time L Babai Proceedings of the forty-eighth annual ACM symposium on Theory of Computing …, 2016 | 1188 | 2016 |
| Non-deterministic exponential time has two-prover interactive protocols L Babai, L Fortnow, C Lund Computational complexity 1 (1), 3-40, 1991 | 1111 | 1991 |
| A fast and simple randomized parallel algorithm for the maximal independent set problem N Alon, L Babai, A Itai Journal of algorithms 7 (4), 567-583, 1986 | 1048 | 1986 |
| Checking computations in polylogarithmic time L Babai, L Fortnow, LA Levin, M Szegedy Proceedings of the twenty-third annual ACM symposium on Theory of computing …, 1991 | 909 | 1991 |
| Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity classes L Babai, S Moran Journal of Computer and System Sciences 36 (2), 254-276, 1988 | 815 | 1988 |
| The hardness of approximate optima in lattices, codes, and systems of linear equations S Arora, L Babai, J Stern, Z Sweedyk Journal of Computer and System Sciences 54 (2), 317-331, 1997 | 653 | 1997 |
| Canonical labeling of graphs L Babai, EM Luks Proceedings of the fifteenth annual ACM symposium on Theory of computing …, 1983 | 643 | 1983 |
| Random graph isomorphism L Babai, P Erdos, SM Selkow SIaM Journal on computing 9 (3), 628-635, 1980 | 518 | 1980 |
| Complexity classes in communication complexity theory L Babai, P Frankl, J Simon 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), 337-347, 1986 | 501 | 1986 |
| BPP has subexponential time simulations unless EXPTIME has publishable proofs L aszl o Babai, L Fortnow, N Nisan, A Wigderson Computational Complexity 3 (4), 307-318, 1993 | 442 | 1993 |
| Automorphism groups, isomorphism, reconstruction L Babai University of Chicago, 1994 | 408 | 1994 |
| Canonical labelling of graphs in linear average time L Babai, L Kucera 20th annual symposium on foundations of computer science (sfcs 1979), 39-46, 1979 | 336 | 1979 |
| Linear algebra methods in combinatorics: with applications to geometry and computer science L Babai, P Frankl Department of Computer Science, univ. of Chicag, 1992 | 334 | 1992 |
| Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs L Babai, N Nisant, M Szegedy Journal of Computer and System Sciences 45 (2), 204-232, 1992 | 329 | 1992 |
| On the complexity of matrix group problems I L Babai, E Szemerédi 25th Annual Symposium onFoundations of Computer Science, 1984., 229-240, 1984 | 328 | 1984 |
| Spectra of Cayley graphs L Babai Journal of Combinatorial Theory, Series B 27 (2), 180-189, 1979 | 322 | 1979 |
| Isomorphism of graphs with bounded eigenvalue multiplicity L Babai, DY Grigoryev, DM Mount Proceedings of the fourteenth annual ACM symposium on Theory of computing …, 1982 | 288 | 1982 |
| Monte-Carlo algorithms in graph isomorphism testing L Babai Université tde Montréal Technical Report, DMS, 1979 | 273 | 1979 |
Peter FranklHungarian Academy of SciencesVerified email at renyi.mta.hu
