@article{1,
author = {L{\'a}szl{\'o} Babai},
title = {Coloring infinite graphs ({H}ungarian)},
journal = {Matematikai Lapok},
year = {1969},
volume = {20},
pages = {141--143},
keywords = {combinatorics, transfinite},
ranking = {175}
}
@inproceedings{2,
author = {L{\'a}szl{\'o} Babai},
title = {Representation of permutation groups by graphs},
booktitle = {Combinatorial Theory and its Applications},
year = {1970},
editor = {P{\'a}l Erd{\H o}s et al.},
series = {Proc. Conf. Balatonf{\"u}red, 1969},
pages = {55--80},
address = {Hungary},
publisher = {Bolyai Society -- North-Holland},
keywords = {automorphisms, groups, prescribed},
ranking = {160}
}
@article{3,
author = {L{\'a}szl{\'o} Babai},
title = {Automorphism groups of planar graphs {I}},
journal = {Discrete Math.},
year = {1972},
volume = {2},
number = {4},
pages = {295--307},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {120},
doi = {10.1016/0012-365X(72)90010-6}
}
@article{4,
author = {L{\'a}szl{\'o} Babai},
title = {Groups of graphs on given surfaces},
journal = {Acta Math. Acad. Sci. Hung.},
year = {1973},
volume = {24},
number = {1-2},
pages = {215--221},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {084},
doi = {10.1007/BF01894629}
}
@article{5,
author = {L{\'a}szl{\'o} Babai and Wilfried Imrich},
title = {On groups of polyhedral graphs},
journal = {Discrete Math.},
year = {1973},
volume = {5},
number = {1},
pages = {101--103},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {160},
doi = {10.1016/0012-365X(73)90030-7}
}
@article{6,
author = {L{\'a}szl{\'o} Babai and L{\'a}szl{\'o} Lov{\'a}sz},
title = {Permutation groups and almost regular graphs},
journal = {Studia Sci. Math. Hung.},
year = {1973},
volume = {8},
pages = {141--150},
keywords = {automorphisms, groups},
ranking = {155}
}
@inproceedings{7,
author = {L{\'a}szl{\'o} Babai and Wilfried Imrich and L{\'a}szl{\'o} Lov{\'a}sz},
title = {Finite homeomorphism groups of the 2-sphere},
booktitle = {Topics in Topology},
year = {1973},
editor = {{\'A}. Cs{\'a}sz{\'a}r},
series = {Proc. Conf. Keszthely, 1972},
pages = {61--75},
address = {Hungary},
publisher = {Bolyai Society -- North-Holland},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {155}
}
@inproceedings{8,
author = {L{\'a}szl{\'o} Babai and Attila M{\'a}t{\'e}},
title = {Inner set mappings on locally compact spaces},
booktitle = {Topics in Topology},
year = {1973},
editor = {{\'A}. Cs{\'a}sz{\'a}r},
series = {Proc. Conf. Keszthely, Hungary 1972},
pages = {77--95},
address = {Hungary},
publisher = {Bolyai Society -- North-Holland},
keywords = {topology, transfinite},
ranking = {135}
}
@article{9,
author = {L{\'a}szl{\'o} Babai},
title = {Automorphism groups of graphs and edge-contraction},
journal = {Discrete Math.},
year = {1974},
volume = {8},
number = {1},
pages = {13--20},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {60},
doi = {10.1016/0012-365X(74)90104-6}
}
@article{10,
author = {L{\'a}szl{\'o} Babai},
title = {A remark on contraction of graphs with given group},
journal = {Acta Math. Acad. Sci. Hung.},
year = {1974},
volume = {25},
number = {1-2},
pages = {89--91},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {125},
doi = {10.1007/BF01901750}
}
@article{11,
author = {L{\'a}szl{\'o} Babai},
title = {On the minimum order of graphs with given group},
journal = {Canad. Math. Bull.},
year = {1974},
volume = {17},
number = {4},
pages = {467--470},
keywords = {automorphisms, groups, prescribed},
ranking = {125},
doi = {10.4153/CMB-1974-082-9}
}
@inproceedings{12,
author = {L{\'a}szl{\'o} Babai},
title = {Automorphism groups of planar graphs {II}},
booktitle = {Infinite and finite sets},
year = {1975},
editor = {A. Hajnal et al.},
series = {Proc. Conf. Keszthely, Hungary, 1973},
pages = {29--84},
address = {Hungary},
publisher = {Bolyai Society -- North-Holland},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {090}
}
@article{13,
author = {L{\'a}szl{\'o} Babai and Wilfried Imrich},
title = {Sense preserving groups of polyhedral graphs},
journal = {Monatshefte Math.},
year = {1975},
volume = {79},
number = {1},
pages = {1--2},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {155},
doi = {10.1007/BF01533769}
}
@phdthesis{14,
author = {L{\'a}szl{\'o} Babai},
title = {Automorphism groups of graphs},
school = {Hungarian Academy of Sciences},
year = {1975},
type = {Ph.{D}. {T}hesis},
note = {In {H}ungarian, 308 pages.},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {090}
}
@article{15,
author = {L{\'a}szl{\'o} Babai},
title = {Asymmetric trees with two prescribed degrees},
journal = {Acta Math. Acad. Sci. Hung.},
year = {1977},
volume = {29},
number = {1-2},
pages = {193--200},
keywords = {automorphisms, asymmetry},
ranking = {120},
doi = {10.1007/BF01896481}
}
@article{16,
author = {L{\'a}szl{\'o} Babai},
title = {Some applications of graph contractions},
journal = {J. Graph Theory},
year = {1977},
volume = {1},
number = {2},
pages = {125--130},
keywords = {automorphisms, groups, topological_graph_theory},
ranking = {105},
doi = {10.1002/jgt.3190010207}
}
@article{17,
author = {L{\'a}szl{\'o} Babai},
title = {Isomorphism problem for a class of point-symmetric structures},
journal = {Acta Math. Acad. Sci. Hung.},
year = {1977},
volume = {29},
number = {3-4},
pages = {329--336},
keywords = {groups, CI, Cayley_graphs},
ranking = {075},
doi = {10.1007/BF01895854}
}
@article{18,
author = {L{\'a}szl{\'o} Babai},
title = {On the collineation groups of infinite projective and affine planes},
journal = {J. of Geometry},
year = {1977},
volume = {10},
number = {1-2},
pages = {138--145},
keywords = {automorphisms, groups, prescribed},
ranking = {160},
doi = {10.1007/BF01933067}
}
@article{19,
author = {L{\'a}szl{\'o} Babai},
title = {Symmetry groups of vertex-transitive polytopes},
journal = {Geometriae Dedicata},
year = {1977},
volume = {6},
number = {3},
pages = {331--337},
keywords = {automorphisms, groups, vertex-transitive_graphs, prescribed, GRR},
ranking = {145},
doi = {10.1007/BF02429904}
}
@techreport{20,
author = {L{\'a}szl{\'o} Babai},
title = {On the isomorphism problem},
year = {1977},
note = {Appended to Proc. Conf. FCT'77, Poznan-Kornik. 10 pages.},
keywords = {isomorphism, graph_isomorphism, algorithms, complexity},
ranking = {084}
}
@incollection{21,
author = {L{\'a}szl{\'o} Babai},
title = {Chromatic number and subgraphs of {C}ayley graphs},
booktitle = {Theory and Appl. of Graphs},
publisher = {Springer},
year = {1978},
editor = {Y. Alavi and D.R. Lick},
volume = {642},
series = {Lecture Notes in Math.},
pages = {10--22},
keywords = {Cayley_graphs, vertex-transitive_graphs, symmetry},
ranking = {096},
doi = {10.1007/BFb0070361}
}
@article{22,
author = {L{\'a}szl{\'o} Babai},
title = {Automorphism group and category of cospectral graphs},
journal = {Acta Math. Acad. Sci. Hung.},
year = {1978},
volume = {31},
number = {3-4},
pages = {295--306},
keywords = {automorphisms, groups, spectrum, semigroups, categories},
ranking = {135},
doi = {10.1007/BF01901979}
}
@inproceedings{23,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl},
title = {Isomorphisms of {C}ayley graphs {I}},
booktitle = {Combinatorics (Proc. Conf. Keszthely, Hungary, 1976)},
year = {1978},
editor = {A. Hajnal and Vera T. S{\'o}s},
pages = {35--52},
publisher = {Bolyai Society -- North-Holland},
keywords = {groups, CI, Cayley_graphs},
ranking = {128}
}
@inproceedings{24,
author = {L{\'a}szl{\'o} Babai and Jaroslav Ne{\v s}et{\v r}il},
title = {High chromatic rigid graphs {I}},
booktitle = {Combinatorics (Proc. Conf. Keszthely, Hungary, 1976)},
year = {1978},
editor = {A. Hajnal and Vera T. S{\'o}s},
pages = {53--60},
publisher = {Bolyai Society -- North-Holland},
keywords = {automorphisms, groups, asymmetry, semigroups},
ranking = {138},
note = {See item 1982:61.}
}
@inproceedings{25,
author = {L{\'a}szl{\'o} Babai},
title = {Embedding graphs in {C}ayley graphs},
booktitle = {Probl. Combinatoires et Theorie des Graphes (Proc. Conf. Paris-Orsay 1976)},
year = {1978},
editor = {J-C. Bermond et al.},
pages = {13--15},
address = {Paris},
organization = {Centre National de Rech. Sci.},
keywords = {groups, Cayley_graphs, vertex-transitive_graphs},
ranking = {120}
}
@article{26,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl},
title = {Infinite quasigroups with given regular automorphism groups},
journal = {Algebra Universalis},
year = {1978},
volume = {8},
number = {1},
pages = {310--319},
keywords = {automorphisms, groups, prescribed, highly_regular},
ranking = {135},
doi = {10.1007/BF02485401}
}
@article{27,
author = {L{\'a}szl{\'o} Babai},
title = {Infinite digraphs with given regular automorphism groups},
journal = {J. Combin. Theory Ser. B},
year = {1978},
volume = {25},
number = {1},
pages = {26--46},
keywords = {automorphisms, groups, prescribed, transfinite, GRR, combinatorics_journals},
ranking = {060},
doi = {10.1016/S0095-8956(78)80008-2}
}
@article{28,
author = {L{\'a}szl{\'o} Babai and Francis J. Pastijn},
title = {On semigroups with high symmetry},
journal = {Simon Stevin},
year = {1978},
volume = {52},
pages = {73--84},
keywords = {automorphisms, groups, semigroups, symmetry},
ranking = {138}
}
@article{29,
author = {L{\'a}szl{\'o} Babai},
title = {On a conjecture of {M}.{E}. {W}atkins on graphical regular representations of finite groups},
journal = {Compositio Math.},
year = {1978},
volume = {37},
number = {3},
pages = {291--296},
keywords = {automorphisms, groups, GRR},
ranking = {130},
url = {http://www.numdam.org/item?id=CM_1978__37_3_291_0}
}
@article{30,
author = {L{\'a}szl{\'o} Babai},
title = {Vector representable matroids of given rank with given automorphism group},
journal = {Discrete Math.},
year = {1978},
volume = {24},
number = {2},
pages = {119--125},
keywords = {automorphisms, groups, prescribed},
ranking = {150},
doi = {10.1016/0012-365X(78)90190-5}
}
@article{31,
author = {L{\'a}szl{\'o} Babai},
title = {Tournaments with given (infinite) automorphism group},
journal = {Periodica Math. Hung.},
year = {1979},
volume = {10},
number = {1},
pages = {99--104},
keywords = {automorphisms, groups, prescribed},
ranking = {160},
doi = {10.1007/BF02018377}
}
@inproceedings{32,
author = {L{\'a}szl{\'o} Babai},
title = {Endomorphisms of sub- and factorsemigroups},
booktitle = {Algebraic theory of semigroups (Proc. Conf. Szeged, 1976)},
year = {1979},
editor = {G. Poll{\'a}k},
volume = {20},
pages = {43-50},
organization = {Colloq. Math. Soc. J. Bolyai},
publisher = {Bolyai Society -- North-Holland},
keywords = {automorphisms, groups, semigroups, categories},
ranking = {150}
}
@article{33,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl and J{\'a}nos Koll{\'a}r and Gert Sabidussi},
title = {{H}amiltonian cubic graphs and centralizers of involutions},
journal = {Canad. J. Math.},
year = {1979},
volume = {31},
number = {3},
pages = {458--464},
keywords = {automorphisms, groups, prescribed, group_theory},
ranking = {150},
doi = {10.4153/CJM-1979-051-8}
}
@inproceedings{34,
author = {L{\'a}szl{\'o} Babai and Lud{\v e}k Ku{\v c}era},
title = {Canonical labelling of graphs in linear average time},
booktitle = {Proc. 20th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1979},
pages = {39--46},
organization = {IEEE},
keywords = {algorithms, isomorphism, graph_isomorphism, random, FOCS, STOC_FOCS},
ranking = {060},
doi = {10.1109/SFCS.1979.8}
}
@techreport{35,
author = {L{\'a}szl{\'o} Babai},
title = {{M}onte {C}arlo algorithms in graph isomorphism testing},
institution = {Universit{\'e} de Montr{\'e}al},
year = {1979},
type = {Tech. Rep.},
number = {79--10},
note = {42 pages.},
url = {http://people.cs.uchicago.edu/~laci/lasvegas79.pdf},
keywords = {isomorphism, graph_isomorphism, algorithms, groups, random, algorithmic_group_theory},
ranking = {009}
}
@article{36,
author = {L{\'a}szl{\'o} Babai},
title = {Long cycles in vertex transitive graphs},
journal = {J. Graph Theory},
year = {1979},
volume = {3},
number = {3},
pages = {301--304},
keywords = {automorphisms, vertex-transitive_graphs, symmetry},
ranking = {045},
doi = {10.1002/jgt.3190030314}
}
@article{37,
author = {L{\'a}szl{\'o} Babai},
title = {Spectra of {C}ayley graphs},
journal = {J. Combin. Theory Ser. B},
year = {1979},
volume = {27},
number = {2},
pages = {180--189},
keywords = {Cayley graphs, vertex-transitive_graphs, spectrum},
ranking = {075},
doi = {10.1016/0095-8956(79)90079-0}
}
@article{38,
author = {L{\'a}szl{\'o} Babai and Wilfried Imrich},
title = {Tournaments with given regular group},
journal = {Aequationes Math.},
year = {1979},
volume = {19},
number = {1},
pages = {232--244},
keywords = {automorphisms, groups, prescribed, GRR},
ranking = {165},
doi = {10.1007/BF02189868}
}
@article{39,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl},
title = {Isomorphisms of {C}ayley graphs {II}},
journal = {Acta Math. Acad. Sci. Hung.},
year = {1979},
volume = {34},
number = {1-2},
pages = {177--183},
keywords = {groups, CI, Cayley_graphs},
ranking = {128},
doi = {10.1007/BF01902606}
}
@article{40,
author = {L{\'a}szl{\'o} Babai},
title = {On the complexity of canonical labelling of strongly regular graphs},
journal = {SIAM J. Comput.},
year = {1980},
volume = {9},
number = {1},
pages = {212--216},
keywords = {algorithms, isomorphism, automorphisms, groups, graph isomorphism, highly_regular, asymptotic_group_theory},
ranking = {045},
doi = {10.1137/0209018}
}
@article{41,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl},
title = {On set-intersections},
journal = {J. Combin. Theory Ser. A},
year = {1980},
volume = {28},
number = {1},
pages = {103--105},
keywords = {combinatorics, extremal_combinatorics},
ranking = {057},
doi = {10.1016/0097-3165(80)90063-1}
}
@article{42,
author = {L{\'a}szl{\'o} Babai and Mark E. Watkins},
title = {Connectivity of infinite graphs having a transitive torsion group action},
journal = {Archiv der Math.},
year = {1980},
volume = {34},
number = {1},
pages = {90--96},
keywords = {automorphisms, groups, vertex-transitive_graphs, symmetry},
ranking = {066},
doi = {10.1007/BF01224935}
}
@article{43,
author = {L{\'a}szl{\'o} Babai and P{\'a}l Erd{\H o}s and Stanley M. Selkow},
title = {Random graph isomorphism},
journal = {SIAM J. Comput.},
year = {1980},
volume = {9},
number = {3},
pages = {628--635},
keywords = {algorithms, isomorphism, graph_isomorphism, random},
ranking = {060},
doi = {10.1137/0209047}
}
@article{44,
author = {L{\'a}szl{\'o} Babai},
title = {Almost all {S}teiner triple systems are asymmetric},
journal = {Annals of Discr. Math.},
year = {1980},
volume = {7},
pages = {37--39},
note = {Part of ``Topics on Steiner Systems'' (C.C. Lindner and A. Rosa, eds.).},
keywords = {automorphisms, asymmetry, highly_regular},
ranking = {075},
doi = {10.1016/S0167-5060(08)70169-9}
}
@article{45,
author = {L{\'a}szl{\'o} Babai and Ale{\v s} Pultr},
title = {Endomorphism monoids and topological subgraphs of graphs},
journal = {J. Combin. Theory Ser. B},
year = {1980},
volume = {28},
number = {3},
pages = {278--283},
keywords = {automorphisms, semigroups, topological_graph_theory},
ranking = {072},
doi = {10.1016/0095-8956(80)90073-8}
}
@inproceedings{46,
author = {L{\'a}szl{\'o} Babai},
title = {Two remarks on the complexity of graph isomorphism testing},
booktitle = {Proc. West Coast Conf. on Combinatorics, Graph Th. and Computing, Humboldt State University 1979},
year = {1980},
editor = {P.Z. Chinn and D. McCarthy},
pages = {95--99},
address = {Winnipeg},
publisher = {Utilitas Math.},
keywords = {complexity, isomorphism, algorithms, graph_isomorphism},
ranking = {126}
}
@article{47,
author = {L{\'a}szl{\'o} Babai},
title = {Finite digraphs with given regular automorphism groups},
journal = {Periodica Math. Hung.},
year = {1980},
volume = {11},
number = {4},
pages = {257--270},
keywords = {automorphisms, groups, prescribed, GRR},
ranking = {138},
doi = {10.1007/BF02107568}
}
@article{48,
author = {L{\'a}szl{\'o} Babai},
title = {Isomorphism testing and symmetry of graphs {I}},
journal = {Annals of Discr. Math.},
year = {1980},
volume = {8},
pages = {101--109},
note = {Part of ``Combinatorics 79'' (M. Deza and I.G. Rosenberg, eds.)},
keywords = {isomorphism, graph_isomorphism, algorithms, survey},
ranking = {149},
doi = {10.1016/S0167-5060(08)70857-4}
}
@article{49,
author = {Michael E. Adams and L{\'a}szl{\'o} Babai and Ji{\v r}i Sichler},
title = {Automorphism groups of finite distributive lattices with a given sublattice of fixed points},
journal = {Monatshefte Math.},
year = {1980},
volume = {90},
number = {4},
pages = {259--266},
keywords = {automorphisms, groups, prescribed, lattices},
ranking = {140},
doi = {10.1007/BF01540845}
}
@article{50,
author = {L{\'a}szl{\'o} Babai},
title = {{K}ospektrale {G}raphen mit vorgegebenen {A}utomorphismengruppen},
journal = {Wissenschaftliche Zeitschr. der Technischen Hochschule Ilmenau},
year = {1981},
volume = {27},
number = {4},
pages = {31--37},
keywords = {automorphisms, prescribed, spectrum},
ranking = {131}
}
@article{51,
author = {L{\'a}szl{\'o} Babai},
title = {Some problems on lattice automorphisms},
journal = {Studia Sci. Math. Hung.},
year = {1978},
volume = {13},
pages = {139--142},
keywords = {automorphisms, groups, lattices},
ranking = {114}
}
@inproceedings{52,
author = {L{\'a}szl{\'o} Babai},
title = {On the abstract group of automorphisms},
booktitle = {Proc. 8th British Combinatorial Conf.},
year = {1981},
editor = {H.N.V. Temperley},
volume = {52},
series = {Lecture Note},
pages = {1--40},
organization = {London Math. Soc.},
publisher = {Cambridge Univ. Press},
keywords = {automorphisms, groups, survey},
ranking = {114},
url = {http://staff.computing.dundee.ac.uk/kedwards/bcc/past.html\#bcc8}
}
@article{53,
author = {L{\'a}szl{\'o} Babai},
title = {On the order of uniprimitive permutation groups},
journal = {Ann. of Math.},
year = {1981},
volume = {113},
number = {3},
pages = {553--568},
keywords = {groups, isomorphism, asymptotic_group_theory, highly_regular, graph_isomorphism, combinatorics_in_groups, motivated_by, pr},
ranking = {003},
url = {http://www.jstor.org/stable/2006997}
}
@inproceedings{54,
author = {L{\'a}szl{\'o} Babai},
title = {Moderately exponential bound for graph isomorphism},
booktitle = {Proc. 1981 International FCT-Conference (FCT'81)},
year = {1981},
editor = {G{\'e}cseg},
volume = {117},
series = {Lecture Notes in Computer Science},
pages = {34--50},
publisher = {Springer},
keywords = {isomorphism, graph_isomorphism, groups, algorithmic_group_theory, other_conf},
ranking = {084},
doi = {10.1007/3-540-10854-8_4}
}
@article{55,
author = {L{\'a}szl{\'o} Babai and Dwight Duffus},
title = {Dimension and automorphism groups of lattices},
journal = {Algebra Universalis},
year = {1981},
volume = {12},
number = {1},
pages = {279--289},
keywords = {automorphisms, groups, lattices},
ranking = {096},
doi = {10.1007/BF02483890}
}
@inproceedings{56,
author = {L{\'a}szl{\'o} Babai},
title = {On strong embeddings of categories},
booktitle = {Universal Algebra (Proc. Conf. Esztergom 1977)},
year = {1981},
editor = {B. Cs{\'a}k{\'a}ny and E.T. Schmidt},
volume = {29},
pages = {37--51},
series = {Coll. Math. Soc. J. Bolyai},
publisher = {Bolyai Society -- North-Holland},
keywords = {automorphisms, semigroups, categories},
ranking = {135}
}
@article{57,
author = {L{\'a}szl{\'o} Babai and Peter J. Cameron and Michel Deza and Navin M. Singhi},
title = {On sharply edge-transitive permutation groups},
journal = {J. Algebra},
year = {1981},
number = {2},
volume = {73},
pages = {573--585},
keywords = {automorphisms, groups, vertex-transitive_graphs, permutation_groups, JAlg},
ranking = {108},
doi = {10.1016/0021-8693(81)90336-7}
}
@article{58,
author = {L{\'a}szl{\'o} Babai},
title = {Pr{\'\i}msz{\'a}mok {\'e}s titkos{\'\i}r{\'a}s (Prime numbers and cryptography)},
journal = {Term{\'e}szet Vil{\'a}ga},
year = {1981},
volume = {112},
number = {6},
pages = {250--253},
note = {In Hungarian.},
keywords = {popular},
ranking = {65}
}
@article{59,
author = {L{\'a}szl{\'o} Babai},
title = {On the order of doubly transitive permutation groups},
journal = {Inventiones Math.},
year = {1982},
volume = {65},
number = {3},
pages = {473--484},
keywords = {asymptotic_group_theory, groups, pr, combinatorics_in_groups, random},
ranking = {006},
doi = {10.1007/BF01396631}
}
@article{60,
author = {L{\'a}szl{\'o} Babai and Chris D. Godsil},
title = {On the automorphism groups of almost all {C}ayley graphs},
journal = {Europ. J. Comb.},
year = {1982},
volume = {3},
number = {1},
pages = {6--15},
keywords = {automorphisms, groups, Cayley_graphs, GRR},
ranking = {066},
doi = {10.1016/S0195-6698(82)80003-6}
}
@article{61,
author = {L{\'a}szl{\'o} Babai and Jaroslav Ne{\v s}et{\v r}il},
title = {High chromatic rigid graphs {II}},
journal = {Annals of Discr. Math.},
year = {1982},
volume = {15},
pages = {55--61},
note = {In ``Algebraic and Geometric Combinatorics'' (E. Mendelsohn ed.). See item 1978:24.},
keywords = {automorphisms, groups, asymmetry, semigroups},
ranking = {138},
doi = {10.1016/S0304-0208(08)73252-3}
}
@article{62,
author = {L{\'a}szl{\'o} Babai and Fan R. K. Chung and P{\'a}l Erd{\H o}s and Ronald L. Graham and Joel H. Spencer},
title = {On graphs which contain all sparse graphs},
journal = {Annals of Discr. Math.},
year = {1982},
volume = {12},
pages = {21--26},
note = {In ``Theory and Practice of Combinatorics'' (A. Rosa, G. Sabidussi, J. Turgeon eds.).},
keywords = {combinatorics, extremal_combinatorics},
ranking = {078},
doi = {10.1016/S0304-0208(08)73486-8}
}
@article{63,
author = {L{\'a}szl{\'o} Babai and P{\'a}l Erd{\H o}s},
title = {Representation of group elements as short products},
journal = {Annals of Discr. Math.},
year = {1982},
volume = {12},
pages = {27--30},
note = {In ``Theory and Practice of Combinatorics'' (A. Rosa, G. Sabidussi, J. Turgeon eds.).},
keywords = {groups, combinatorics_in_groups, asymptotic_group_theory},
ranking = {075},
doi = {10.1016/S0304-0208(08)73487-X}
}
@inproceedings{64,
author = {L{\'a}szl{\'o} Babai and Dmitri Yu. Grigor'ev and David M. Mount},
title = {Isomorphism of graphs with bounded eigenvalue multiplicity},
booktitle = {Proc. 14th STOC},
publisher = {ACM Press},
year = {1982},
pages = {310--324},
keywords = {isomorphism, graph_isomorphism, algorithms, spectrum, STOC, STOC_FOCS},
ranking = {027},
doi = {10.1145/800070.802206}
}
@article{65,
author = {L{\'a}szl{\'o} Babai and Peter J. Cameron and P{\'e}ter P. P{\'a}lfy},
title = {On the orders of primitive groups with restricted nonabelian composition factors},
journal = {J. Algebra},
year = {1982},
volume = {79},
number = {1},
pages = {161--168},
keywords = {groups, asymptotic_group_theory, motivated_by, JAlg},
ranking = {018},
doi = {10.1016/0021-8693(82)90323-4}
}
@article{66,
author = {L{\'a}szl{\'o} Babai and R{\'o}bert Freud and Rezs{\H o} Kunfalvy},
title = {{P}r{\'\i}msz{\'a}mvad{\'a}szat sz{\'a}m{\'\i}t{\'o}g{\'e}ppel ({H}unting for prime numbers with a computer)},
journal = {Term{\'e}szet Vil{\'a}ga},
year = {1982},
volume = {113},
number = {5},
pages = {201--205},
note = {In Hungarian.},
keywords = {popular},
ranking = {145}
}
@inproceedings{67,
author = {L{\'a}szl{\'o} Babai and Eugene M. Luks},
title = {Canonical labeling of graphs},
booktitle = {Proc. 15th STOC},
publisher = {ACM Press},
year = {1983},
pages = {171--183},
keywords = {graph-isomorphism, algorithms, highly_regular, STOC, STOC_FOCS},
ranking = {030},
doi = {10.1145/800061.808746}
}
@inproceedings{68,
author = {L{\'a}szl{\'o} Babai and William M. Kantor and Eugene M. Luks},
title = {Computational complexity and the classification of finite simple groups},
booktitle = {Proc. 24th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1983},
pages = {162--171},
keywords = {algorithmic_group_theory, isomorphism, graph_isomorphism, asymptotic_group_theory, FOCS, STOC_FOCS},
ranking = {054},
doi = {10.1109/SFCS.1983.10}
}
@book{69,
author = {L{\'a}szl{\'o} Babai},
title = {Permutation Groups, Coherent Configurations and Graph Isomorphism},
year = {1984},
note = {D.Sc. Thesis, Hungarian Academy of Sciences. In Hungarian.},
keywords = {automorphisms, groups, permutation_groups, highly_regular, graph-isomorphism},
ranking = {048}
}
@inproceedings{70,
author = {L{\'a}szl{\'o} Babai and Endre Szemer{\'e}di},
title = {On the complexity of matrix group problems {I}},
booktitle = {Proc. 25th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1984},
pages = {229--240},
keywords = {complexity, algorithmic_group_theory, matrix_groups, asymptotic_group_theory, FOCS, STOC_FOCS},
ranking = {033},
doi = {10.1109/SFCS.1984.715919}
}
@inproceedings{71,
author = {L{\'a}szl{\'o} Babai},
title = {On {L}ov{\'a}sz' lattice reduction and the nearest lattice point problem},
booktitle = {Proc. 2nd Symp. Theoretical Aspects of Comp. Sci. (STACS'85)},
publisher = {Springer},
year = {1985},
volume = {182},
series = {Springer Lecture Notes in Comp. Sci.},
pages = {13--20},
note = {See 1986.77.},
keywords = {algorithms, lattice_vector, other_conf},
ranking = {024},
doi = {10.1007/BFb0023990}
}
@inproceedings{72,
author = {L{\'a}szl{\'o} Babai},
title = {Trading group theory for randomness},
booktitle = {Proc. 17th STOC},
publisher = {ACM Press},
year = {1985},
pages = {421--429},
keywords = {complexity, interactive_proofs, random, algorithmic_group_theory, STOC, STOC_FOCS},
ranking = {012},
doi = {10.1145/22145.22192}
}
@article{73,
author = {L{\'a}szl{\'o} Babai},
title = {An anti-{R}amsey theorem},
journal = {Graphs and Combinatorics},
year = {1985},
volume = {1},
number = {1},
pages = {23--28},
keywords = {combinatorics, extremal_combinatorics, random, combinatorics_journals},
ranking = {078},
doi = {10.1007/BF02582925}
}
@article{74,
author = {L{\'a}szl{\'o} Babai},
title = {Arc transitive covering digraphs and their eigenvalues},
journal = {J. Graph Theory},
year = {1985},
volume = {9},
number = {3},
pages = {363--370},
keywords = {groups, automorphisms, symmetry, vertex-transitive_graphs, spectrum, combinatorics_journals},
ranking = {114},
doi = {10.1002/jgt.3190090308}
}
@article{75,
author = {L{\'a}szl{\'o} Babai and Vera T. S{\'o}s},
title = {Sidon sets in groups and induced subgraphs of {C}ayley graphs},
journal = {Europ. J. Comb.},
year = {1985},
volume = {6},
number = {2},
pages = {101--114},
keywords = {groups, Cayley_graphs, vertex-transitive_graphs, combinatorics_in_groups, combinatorics_journals, inspired},
ranking = {096},
doi = {10.1016/S0195-6698(85)80001-9}
}
@inproceedings{76,
author = {Mikl{\'o}s Ajtai and L{\'a}szl{\'o} Babai and P{\'e}ter Hajnal and J{\'a}nos Koml{\'o}s and Pavel Pudl{\'a}k and Vojt{\v e}ch R{\"o}dl and Endre Szemer{\'e}di and Gy{\"o}rgy Tur{\'a}n},
title = {Two lower bounds for branching programs},
booktitle = {Proc. 18th STOC},
publisher = {ACM Press},
year = {1986},
pages = {30--38},
keywords = {complexity, lower_bounds, STOC, STOC_FOCS},
ranking = {063},
doi = {10.1145/12130.12134}
}
@comment{{Wow, you guys really put all your heads together on that one}}
@article{77,
author = {L{\'a}szl{\'o} Babai},
title = {On {L}ov{\'a}sz' lattice reduction and the nearest lattice point problem},
journal = {Combinatorica},
year = {1986},
volume = {6},
number = {1},
pages = {1--13},
note = {Full version of 1985.71.},
keywords = {algorithms, lattice_vector, combinatorics_journals},
ranking = {024},
doi = {10.1007/BF02579403}
}
@inproceedings{78,
author = {L{\'a}szl{\'o} Babai},
title = {A {L}as {V}egas--$\mathsf{NC}$ algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues},
booktitle = {Proc. 27th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1986},
pages = {303--312},
keywords = {isomorphism, graph_isomorphism, spectrum, algorithmic_group_theory, algorithms, complexity, random},
ranking = {111},
doi = {10.1109/SFCS.1986.1}
}
@inproceedings{79,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl and Janos Simon},
title = {Complexity classes in communication complexity theory},
booktitle = {Proc. 27th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1986},
pages = {337--347},
keywords = {complexity, communication_complexity, lower_bounds, FOCS, STOC_FOCS},
ranking = {036},
doi = {10.1109/SFCS.1986.15}
}
@article{80,
author = {L{\'a}szl{\'o} Babai},
title = {On the length of subgroup chains in the symmetric group},
journal = {Comm. Algebra},
year = {1986},
volume = {14},
number = {9},
pages = {1729--1736},
keywords = {groups, asymptotic_group_theory, permutation_groups},
ranking = {063},
doi = {10.1080/00927878608823393}
}
@article{81,
author = {Noga Alon and L{\'a}szl{\'o} Babai and Alon Itai},
title = {A fast and simple randomized parallel algorithm for the maximal independent set problem},
journal = {J. Algorithms},
year = {1986},
volume = {7},
number = {4},
pages = {567--583},
keywords = {algorithms, complexity, codes, lower_bounds, random},
ranking = {039},
doi = {10.1016/0196-6774(86)90019-2}
}
@article{82,
author = {L{\'a}szl{\'o} Babai},
title = {On the non-uniform {F}isher inequality},
journal = {Discrete Math.},
year = {1987},
volume = {66},
number = {3},
pages = {303--307},
keywords = {combinatorics, extremal_combinatorics, combinatorics_journals},
ranking = {087},
doi = {10.1016/0012-365X(87)90106-3}
}
@inproceedings{83,
author = {L{\'a}szl{\'o} Babai and Eugene M. Luks and {\'A}kos Seress},
title = {Permutation groups in $\mathsf{NC}$},
booktitle = {Proc. 19th STOC},
publisher = {ACM Press},
year = {1987},
pages = {409--420},
keywords = {groups, algorithmic_group_theory, algorithms, complexity, STOC, STOC_FOCS},
ranking = {042},
doi = {10.1145/28395.28439}
}
@article{84,
author = {L{\'a}szl{\'o} Babai and {\'A}kos Seress},
title = {On the degree of transitivity of permutation groups: {A} short proof},
journal = {J. Combin. Theory Ser. A},
year = {1987},
volume = {45},
number = {2},
pages = {310--315},
keywords = {groups, asymptotic_group_theory, combinatorics_in_groups, combinatorics_journals},
ranking = {051},
doi = {10.1016/0097-3165(87)90023-9}
}
@comment{{check: lower bounds*}}
@article{85,
author = {L{\'a}szl{\'o} Babai and Gy{\"o}rgy Tur{\'a}n},
title = {The complexity of defining a relation on a finite graph},
journal = {Zeitschrift f{\"u}r Mathematische Logik und Grundlagen der Mathematik},
year = {1987},
volume = {33},
number = {3},
pages = {277--288},
keywords = {complexity},
ranking = {136},
doi = {10.1002/malq.19870330312}
}
@comment{{check: spec issue*}}
@article{86,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Hajnal and Endre Szemer{\'e}di and Gy{\"o}rgy Tur{\'a}n},
title = {A lower bound for read-once-only branching programs},
journal = {J. Comput. System Sci.},
year = {1987},
volume = {35},
number = {2},
pages = {153--162},
keywords = {complexity, lower_bounds},
ranking = {063},
doi = {10.1016/0022-0000(87)90010-9}
}
@article{87,
author = {L{\'a}szl{\'o} Babai},
title = {Random oracles separate $\mathsf{PSPACE}$ from the polynomial-time hierarchy},
journal = {Inform. Process. Lett.},
year = {1987},
volume = {26},
number = {1},
pages = {51--53},
keywords = {complexity, lower_bounds, random},
ranking = {051},
doi = {10.1016/0022-0000(87)90010-9}
}
@article{88,
author = {L{\'a}szl{\'o} Babai and {\'A}kos Seress},
title = {On the diameter of {C}ayley graphs of the symmetric group},
journal = {J. Combin. Theory Ser. A},
year = {1988},
volume = {49},
number = {1},
pages = {175--179},
keywords = {automorphisms, groups, combinatorics_in_groups, asymptotic_group_theory, Cayley_graphs, combinatorics_journals},
ranking = {051},
doi = {10.1016/0097-3165(88)90033-7}
}
@article{89,
author = {L{\'a}szl{\'o} Babai and Shlomo Moran},
title = {{A}rthur-{M}erlin games: {A} randomized proof system and a hierarchy of complexity classes},
journal = {J. Comput. System Sci.},
year = {1988},
volume = {36},
number = {2},
pages = {254--276},
keywords = {complexity, interactive_proofs, special_issue},
ranking = {012},
doi = {10.1016/0022-0000(88)90028-1}
}
@article{90,
author = {L{\'a}szl{\'o} Babai},
title = {A short proof of the non-uniform {R}ay-{C}haudhuri--{W}ilson inequality},
journal = {Combinatorica},
year = {1988},
volume = {8},
number = {1},
pages = {133--135},
keywords = {combinatorics, extremal_combinatorics, polynomials, combinatorics_journals},
ranking = {054},
doi = {10.1007/BF02122561}
}
@inproceedings{91,
author = {L{\'a}szl{\'o} Babai and Eugene M. Luks and {\'A}kos Seress},
title = {Fast management of permutation groups},
booktitle = {Proc. 29th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1988},
pages = {272--282},
keywords = {groups, algorithmic_group_theory, algorithms, permutation_groups, FOCS, STOC_FOCS},
ranking = {078},
doi = {10.1109/SFCS.1988.21943},
note = {Conference version of 1997:159}
}
@article{92,
author = {L{\'a}szl{\'o} Babai and Bettina Just and Friedhelm Meier auf der Heide},
title = {On the limits of computations with the floor function},
journal = {Inform. and Comput.},
year = {1988},
volume = {78},
number = {2},
pages = {99--107},
keywords = {complexity, lower_bounds},
ranking = {141},
doi = {10.1016/0890-5401(88)90031-4}
}
@inproceedings{93,
author = {L{\'a}szl{\'o} Babai and Noam Nisan and Mario Szegedy},
title = {Multiparty protocols and {L}ogspace-hard pseudorandom sequences},
booktitle = {Proc. 21st STOC},
publisher = {ACM Press},
year = {1989},
pages = {1--11},
note = {See 1992.126.},
keywords = {complexity, communication_complexity, lower_bounds, STOC, STOC_FOCS},
ranking = {021},
doi = {10.1145/73007.73008}
}
@article{94,
author = {L{\'a}szl{\'o} Babai},
title = {The probability of generating the symmetric group},
journal = {J. Combin. Theory Ser. A},
year = {1989},
volume = {52},
number = {1},
pages = {148--153},
keywords = {groups, asymptotic_group_theory, permutation_groups, combinatorics_journals},
ranking = {078},
doi = {10.1016/0097-3165(89)90068-X}
}
@article{95,
author = {L{\'a}szl{\'o} Babai and Shlomo Moran},
title = {Proving properties of interactive proofs by a generalized counting technique},
journal = {Inform. and Comput.},
year = {1989},
volume = {82},
number = {2},
pages = {185--197},
keywords = {complexity, interactive_proofs},
ranking = {124},
doi = {10.1016/0890-5401(89)90053-9}
}
@inproceedings{96,
author = {L{\'a}szl{\'o} Babai and Lajos R{\'o}nyai},
title = {Computing irreducible representations of finite groups},
booktitle = {Proc. 30th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1989},
pages = {93--98},
note = {See 1990.102},
keywords = {algorithmic_group_theory, algorithmic_algebra, algorithms, FOCS, STOC_FOCS},
ranking = {096},
doi = {10.1109/SFCS.1989.63461}
}
@article{97,
author = {L{\'a}szl{\'o} Babai and William M. Kantor and Alex Lubotsky},
title = {Small diameter {C}ayley graphs for finite simple groups},
journal = {Europ. J. Comb.},
year = {1989},
volume = {10},
number = {6},
pages = {507--522},
keywords = {groups, Cayley_graphs, combinatorics_in_groups, diameter, asymptotic_groups_theory, combinatorics_journals},
ranking = {069},
doi = {10.1016/S0195-6698(89)80067-8}
}
@inproceedings{98,
author = {L{\'a}szl{\'o} Babai},
title = {E-mail and the unexpected power of interaction},
booktitle = {Proc. 5th IEEE Conf. on Structure in Complexity Theory (SCT'90)},
publisher = {IEEE Comp. Soc. Press},
year = {1990},
pages = {30--44},
note = {For Polish translation see item 1995.151.},
keywords = {complexity, interactive_proofs, popular, other_conf},
ranking = {063},
doi = {10.1109/SCT.1990.113952}
}
@inproceedings{99,
author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Carsten Lund},
title = {Nondeterministic exponential time has two-prover interactive protocols},
booktitle = {Proc. 31st FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1990},
pages = {16--25},
note = {See item 1991.108.},
keywords = {complexity, interactive_proofs, property_testing, random, FOCS, STOC_FOCS},
ranking = {015},
doi = {10.1109/FSCS.1990.89520}
}
@inproceedings{100,
author = {L{\'a}szl{\'o} Babai and Lance Fortnow},
title = {A characterization of $\mathsf{\#P}$ by arithmetic straight line programs},
booktitle = {Proc. 31st FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1990},
pages = {26--34},
note = {See item 1991.109.},
keywords = {complexity, interactive_proofs, FOCS, STOC_FOCS},
ranking = {111},
doi = {10.1109/FSCS.1990.89521}
}
@inproceedings{101,
author = {L{\'a}szl{\'o} Babai and G{\'a}bor Hetyei and William M. Kantor and Alex Lubotsky and {\'A}kos Seress},
title = {On the diameter of finite groups},
booktitle = {Proc. 31st FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1990},
pages = {857--865},
keywords = {groups, Cayley_graphs, diameter, combinatorics_in_groups, asymptotic_group_theory},
ranking = {096},
doi = {10.1109/FSCS.1990.89608}
}
@article{102,
author = {L{\'a}szl{\'o} Babai and Lajos R{\'o}nyai},
title = {Computing irreducible representations of finite groups},
journal = {Mathematics of Computation},
year = {1990},
volume = {55},
number = {192},
pages = {705--722},
note = {Full version of item 1989.96},
keywords = {algorithmic_group_theory, algorithmic_algebra, algorithms},
ranking = {096},
doi = {10.1090/S0025-5718-1990-1035925-1}
}
@article{103,
author = {L{\'a}szl{\'o} Babai and Pavel Pudl{\'a}k and Vojt{\v e}ch R{\"o}dl and Endre Szemer{\'e}di},
title = {Lower bounds to the complexity of symmetric {B}oolean functions},
journal = {Theoret. Comput. Sci.},
year = {1990},
volume = {74},
number = {3},
pages = {313--324},
keywords = {complexity, lower_bounds},
ranking = {063},
doi = {10.1016/0304-3975(90)90080-2}
}
@article{104,
author = {L{\'a}szl{\'o} Babai and Mikl{\'o}s Simonovits and Joel H. Spencer},
title = {Extremal subgraphs of random graphs},
journal = {J. Graph Theory},
year = {1990},
volume = {14},
number = {5},
pages = {599--622},
keywords = {combinatorics, extremal_combinatorics, random},
ranking = {072},
doi = {10.1002/jgt.3190140511}
}
@inproceedings{105,
author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Leonid A. Levin and Mario Szegedy},
title = {Checking computations in polylogarithmic time},
booktitle = {Proc. 23rd STOC},
publisher = {ACM Press},
year = {1991},
pages = {21--32},
keywords = {complexity, interactive_proofs, codes, random, STOC, STOC_FOCS},
ranking = {039},
doi = {10.1145/103418.103428}
}
@inproceedings{106,
author = {L{\'a}szl{\'o} Babai and Gene Cooperman and Larry Finkelstein and Eugene M. Luks and {\'A}kos Seress},
title = {Fast {M}onte-{C}arlo algorithms for permutation groups},
booktitle = {Proc. 23rd STOC},
publisher = {ACM Press},
year = {1991},
pages = {90--100},
keywords = {algorithmic_group_theory, algorithms, random, STOC, STOC_FOCS},
ranking = {072},
doi = {10.1145/103418.103435},
note = {Conference version of item 1995:144}
}
@inproceedings{107,
author = {L{\'a}szl{\'o} Babai},
title = {Local expansion of vertex-transitive graphs and random generation in finite groups},
booktitle = {Proc. 23rd STOC},
publisher = {ACM Press},
year = {1991},
pages = {164--174},
keywords = {groups, symmetry, vertex-transitive_graphs, algorithmic_group_theory, random, Markov_Chains, STOC, STOC_FOCS},
ranking = {25},
doi = {10.1145/103418.103440}
}
@article{108,
author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Carsten Lund},
title = {Nondeterministic exponential time has two-prover interactive protocols},
journal = {Comput. Complexity},
year = {1991},
volume = {1},
number = {1},
pages = {3--40},
note = {Full version of 1990.99},
keywords = {complexity, interactive_proofs, property_testing, random},
ranking = {015},
doi = {10.1007/BF01200056}
}
@article{109,
author = {L{\'a}szl{\'o} Babai and Lance Fortnow},
title = {Arithmetization: {A} new method in structural complexity theory},
journal = {Comput. Complexity},
year = {1991},
volume = {1},
number = {1},
pages = {41--66},
note = {Full version of item 1990.100.},
keywords = {complexity, interactive_proofs},
ranking = {111},
doi = {10.1007/BF01200057}
}
@article{110,
author = {L{\'a}szl{\'o} Babai and Albert J. Goodman and L{\'a}szl{\'o} Lov{\'a}sz},
title = {Graphs with given automorphism group and few edge orbits},
journal = {Europ. J. Comb.},
year = {1991},
volume = {12},
number = {3},
pages = {185--203},
keywords = {automorphisms, prescribed, groups, combinatorics_journals},
ranking = {121},
doi = {10.1016/S0195-6698(13)80085-6}
}
@inproceedings{111,
author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Noam Nisan and Avi Wigderson},
title = {$\mathsf{BPP}$ has subexponential time simulations unless $\mathsf{EXPTIME}$ has publishable proofs},
booktitle = {Proc. 6th IEEE Conf. on Structure in Complexity Theory (SCT'91)},
publisher = {IEEE Comp. Soc. Press},
year = {1991},
pages = {213--219},
address = {Chicago},
organization = {IEEE},
keywords = {complexity, interactive_proofs, other_conf},
ranking = {038},
note = {Conference version of 1993:138},
doi = {10.1109/SCT.1991.160263}
}
@inproceedings{112,
author = {L{\'a}szl{\'o} Babai and Gene Cooperman and Larry Finkelstein and {\'A}kos Seress},
title = {Nearly linear time algorithms for permutation groups with a small base},
booktitle = {Proc. 2nd Internat. Symp. on Symbolic and Algebraic Computation (ISAAC'91)},
publisher = {ACM Press},
year = {1991},
pages = {200--209},
address = {Bonn},
keywords = {algorithmic_group_theory, algorithms, random},
ranking = {049},
doi = {10.1145/120694.120724}
}
@article{113,
author = {Noga Alon and L{\'a}szl{\'o} Babai and Hiroshi Suzuki},
title = {Multilinear polynomials and {F}rankl--{R}ay-{C}haudhuri--{W}ilson type inequalities},
journal = {J. Combin. Theory Ser. A},
year = {1991},
volume = {58},
number = {2},
pages = {165--180},
keywords = {combinatorics, extremal_combinatorics, polynomials, combinatorics_journals},
ranking = {040},
doi = {10.1016/0097-3165(91)90058-O}
}
@article{114,
author = {L{\'a}szl{\'o} Babai},
title = {Vertex-transitive graphs and vertex-transitive maps},
journal = {J. Graph Theory},
year = {1991},
volume = {15},
number = {6},
pages = {587--627},
keywords = {automorphisms, vertex-transitive_graphs, symmetry, topological_graph_theory, graph_limit},
ranking = {037},
doi = {10.1002/jgt.3190150605}
}
@inproceedings{115,
author = {L{\'a}szl{\'o} Babai and Katalin Friedl},
title = {Approximate representation theory of finite groups},
booktitle = {Proc. 32nd FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1991},
pages = {733--742},
address = {Puerto Rico},
keywords = {groups, algorithmic_algebra, algorithms, FOCS, STOC_FOCS},
ranking = {121},
doi = {10.1109/SFCS.1991.185442}
}
@inproceedings{116,
author = {L{\'a}szl{\'o} Babai},
title = {Computational complexity in finite groups},
booktitle = {Proc. Internat. Congress of Mathematicians, Kyoto 1990},
year = {1991},
pages = {1479--1490},
address = {Kyoto},
publisher = {Springer},
keywords = {algorithmic_group_theory, survey},
ranking = {099},
url = {http://www.mathunion.org/ICM/ICM1990.2/}
}
@inproceedings{117,
author = {L{\'a}szl{\'o} Babai},
title = {Deciding finiteness of matrix groups in {L}as {V}egas polynomial time},
booktitle = {Proc. 3rd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'92)},
publisher = {SIAM},
year = {1992},
pages = {33--40},
address = {Orlando, FL},
keywords = {algorithmic_group_theory, algorithms, random, Markov_Chains, SODA},
ranking = {089},
note = {See item 1993:132.},
eprint = {acm:139404.139411}
}
@article{118,
author = {L{\'a}szl{\'o} Babai},
title = {Bounded round interactive proofs in finite groups},
journal = {SIAM J. Discrete Math.},
year = {1992},
volume = {5},
number = {1},
pages = {88--111},
keywords = {complexity, interactive_proofs, algorithmic_group_theory, combinatorics_journals},
ranking = {087},
doi = {10.1137/0405008}
}
@inproceedings{119,
author = {L{\'a}szl{\'o} Babai and Robert Beals and P{\'a}l Tak{\'a}csi-Nagy},
title = {Symmetry and complexity},
booktitle = {Proc. 24th STOC},
publisher = {ACM Press},
year = {1992},
pages = {438--449},
address = {Vancouver B.C.},
keywords = {complexity, lower_bounds, random, STOC, STOC_FOCS},
ranking = {078},
doi = {10.1145/129712.129754}
}
@article{120,
author = {L{\'a}szl{\'o} Babai and Mario Szegedy},
title = {Local expansion of symmetrical graphs},
journal = {Combin. Probab. Comput.},
year = {1992},
volume = {1},
number = {1},
pages = {1--11},
keywords = {automorphisms, vertex-transitive_graphs, symmetry, random, combinatorics_journals},
ranking = {29},
doi = {10.1017/S0963548300000031}
}
@article{121,
author = {L{\'a}szl{\'o} Babai and Tam{\'a}s Lengyel},
title = {A convergence criterion for recurrent sequences with application to the partition lattice},
journal = {Analysis},
year = {1992},
volume = {12},
pages = {109--119},
keywords = {combinatorics, analysis},
ranking = {49},
url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.30.4586}
}
@article{122,
author = {L{\'a}szl{\'o} Babai},
title = {Transparent Proofs},
journal = {FOCUS (MAA Newsletter)},
year = {1992},
volume = {12},
number = {3},
pages = {1--2},
month = {June},
keywords = {complexity, interactive_proofs, popular},
ranking = {79}
}
@article{123,
author = {L{\'a}szl{\'o} Babai},
title = {Combinatorial Optimization Is Hard},
journal = {FOCUS (MAA Newsletter)},
year = {1992},
volume = {12},
number = {4},
pages = {3,6,18},
month = {September},
keywords = {complexity, interactive_proofs, inapproximability, popular},
ranking = {79}
}
@book{124,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl},
title = {Linear Algebra Methods in Combinatorics, with Applications to Geometry and Computer Science},
publisher = {Univ. of Chicago Dept. Computer Sci.},
note = {Unpublished, preliminary version 2, 216 pages.},
year = {1992},
keywords = {combinatorics, extremal_combinatorics, book},
ranking = {27},
url = {http://www.cs.uchicago.edu/research/publications/combinatorics}
}
@article{125,
author = {L{\'a}szl{\'o} Babai and {\'A}kos Seress},
title = {On the diameter of permutation groups},
journal = {Europ. J. Comb.},
year = {1992},
volume = {13},
number = {4},
pages = {231--243},
keywords = {groups, Cayley_graphs, combinatorics_in_groups, diameter, inspire, combinatorics_journals},
ranking = {059},
doi = {10.1016/S0195-6698(05)80029-0}
}
@article{126,
author = {L{\'a}szl{\'o} Babai and Noam Nisan and Mario Szegedy},
title = {Multiparty protocols, pseudorandom generators for {L}ogspace, and time-space trade-offs},
journal = {J. Comput. System Sci.},
year = {1992},
volume = {45},
number = {2},
pages = {204--232},
note = {Special issue. Full version of item 1989.93.},
keywords = {complexity, communication_complexity, lower_bounds, special_issue},
ranking = {021},
doi = {10.1016/0022-0000(92)90047-M}
}
@article{127,
author = {L{\'a}szl{\'o} Babai and G{\'a}bor L. Hetyei},
title = {On the diameter of random {C}ayley graphs of the symmetric group},
journal = {Combin. Probab. Comput.},
year = {1992},
volume = {1},
number = {3},
pages = {201--208},
keywords = {groups, Cayley_graphs, combinatorics_in_groups, diameter, random, combinatorics_journals},
ranking = {061},
doi = {10.1017/S0963548300000237}
}
@article{128,
author = {L{\'a}szl{\'o} Babai and Vera T. S{\'o}s},
title = {{T}ibor {G}allai, 1912--1992},
journal = {Combinatorica},
year = {1992},
volume = {12},
number = {4},
pages = {371--372},
keywords = {bio, combinatorics_journals},
ranking = {064},
doi = {10.1007/BF01305228}
}
@inproceedings{129,
author = {L{\'a}szl{\'o} Babai},
title = {Transparent (holographic) proofs},
booktitle = {Proc. 10th Symp. Theoretical Aspects of Comp. Sci. (STACS'93)},
year = {1993},
publisher = {Springer},
volume = {665},
series = {Springer Lect. Notes in Comp. Sci.},
pages = {525--534},
address = {W{\"u}rzburg (Germany)},
keywords = {complexity, interactive_proofs, survey},
ranking = {107},
doi = {10.1007/3-540-56503-5_52}
}
@article{130,
author = {L{\'a}szl{\'o} Babai and Albert J. Goodman and L{\'a}szl{\'o} Pyber},
title = {On faithful permutation representations of small degree},
journal = {Comm. Algebra},
year = {1993},
volume = {21},
number = {5},
pages = {1587--1602},
keywords = {groups, permutation_groups, asymptotic_group_theory},
ranking = {078},
doi = {10.1080/00927879308824639}
}
@article{131,
author = {L{\'a}szl{\'o} Babai and Albert J. Goodman},
title = {Subdirectly reducible groups and edge-minimal graphs with given automorphism group},
journal = {J. London Math. Soc.},
year = {1993},
volume = {47},
number = {3},
pages = {417--432},
keywords = {automorphisms, groups, prescribed},
ranking = {071},
doi = {10.1112/jlms/s2-47.3.417}
}
@inproceedings{132,
author = {L{\'a}szl{\'o} Babai and Robert Beals and Daniel Rockmore},
title = {Deciding finiteness of matrix groups in deterministic polynomial time},
booktitle = {Proc. 4th Internat. Symp. on Symbolic and Algebraic Computation (ISAAC'93)},
year = {1993},
pages = {117--126},
publisher = {ACM Press},
keywords = {algorithms, algorithmic_group_theory, groups, other_conf},
ranking = {068},
doi = {10.1145/164081.164104},
note = {See item 1992.117.}
}
@inproceedings{133,
author = {L{\'a}szl{\'o} Babai and Katalin Friedl and Marcus Stricker},
title = {Decomposition of *-closed algebras in polynomial time},
booktitle = {Proc. 4th Internat. Symp. on Symbolic and Algebraic Computation (ISAAC'93)},
year = {1993},
pages = {86--94},
publisher = {ACM Press},
keywords = {algorithms, algorithmic_algebra, other_conf},
ranking = {085},
doi = {10.1145/164081.164098}
}
@inproceedings{134,
author = {L{\'a}szl{\'o} Babai and Albert J. Goodman},
title = {On the abstract group of automorphisms},
booktitle = {``Coding Theory, Desing Theory, Group Theory''},
year = {1993},
editor = {D.~Jungnickel and S.~A. Vanstone},
series = {Proc. of Marshall Hall Conf., Burlington VT 1990},
pages = {121--143},
publisher = {Wiley},
keywords = {automorphisms, groups, prescribed, survey},
ranking = {101},
eprint = {acm:164268}
}
@incollection{135,
author = {L{\'a}szl{\'o} Babai and Eugene M. Luks and {\'A}kos Seress},
title = {Computing composition series in primitive groups},
booktitle = {Groups and Computation},
publisher = {Amer. Math. Soc.},
year = {1993},
editor = {L. Finkelstein and W. M. Kantor},
volume = {11},
series = {DIMACS Ser. in Discr. Math. and Theor. Comp. Sci.},
pages = {1--16},
note = {Workshop on groups and computation, Oct 7-10, 1991.},
keywords = {algorithms, groups, algorithmic_group_theory},
ranking = {078}
}
@inproceedings{136,
author = {Sanjeev Arora and L{\'a}szl{\'o} Babai and Jacques Stern and Z. (Elizabeth) Sweedyk},
title = {The hardness of approximate optima in lattices, codes, and systems of linear equations},
booktitle = {Proc. 34th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1993},
pages = {724--733},
address = {Palo Alto CA},
keywords = {complexity, interactive_proofs, inapproximability, codes, lattice_vector, FOCS, STOC_FOCS},
ranking = {026},
doi = {10.1109/SFCS.1993.366815},
note = {Conference version of item 1997:160}
}
@inproceedings{137,
author = {Robert Beals and L{\'a}szl{\'o} Babai},
title = {{L}as {V}egas algorithms for matrix groups},
booktitle = {Proc. 34th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {1993},
pages = {427--436},
address = {Palo Alto CA},
keywords = {algorithmic_group_theory, algorithms, random, matrix_groups,
FOCS, STOC_FOCS},
ranking = {065},
doi = {10.1109/SFCS.1993.366844}
}
@article{138,
author = {L{\'a}szl{\'o} Babai and Lance Fortnow and Noam Nisan and Avi Wigderson},
title = {$\mathsf{BPP}$ has subexponential time simulations unless $\mathsf{EXPTIME}$ has publishable proofs},
journal = {Comput. Complexity},
year = {1993},
volume = {3},
number = {4},
pages = {307--318},
note = {Full version of item 1991.111},
keywords = {complexity, interactive_proofs},
ranking = {038},
doi = {10.1007/BF01275486}
}
@article{139,
author = {L{\'a}szl{\'o} Babai and L{\'a}szl{\'o} Pyber},
title = {Permutation groups without exponentially many orbits on the power set},
journal = {J. Combin. Theory Ser. A},
year = {1994},
volume = {66},
number = {1},
pages = {160--168},
keywords = {groups, permutation_groups, asymptotic_group_theory, combinatorics_journals},
ranking = {097},
doi = {10.1016/0097-3165(94)90056-6}
}
@article{140,
author = {L{\'a}szl{\'o} Babai and Haluk Oral and Kevin T. Phelps},
title = {{E}ulerian self-dual codes},
journal = {SIAM J. Discrete Math.},
year = {1994},
volume = {7},
number = {2},
pages = {325--330},
keywords = {combinatorics, codes, automorphisms, prescribed, combinatorics_journals},
ranking = {138},
doi = {10.1137/S089548019120256X}
}
@inproceedings{141,
author = {L{\'a}szl{\'o} Babai},
title = {Transparent proofs and limits to approximation},
booktitle = {Proc. First European Congress of Mathematics (1992)},
year = {1994},
volume = {I},
pages = {31--91},
publisher = {Birkh{\"a}user Basel},
keywords = {complexity, interactive_proofs, inapproximability, random, survey},
ranking = {047},
doi = {10.1007/978-3-0348-9110-3_2}
}
@inproceedings{142,
author = {L{\'a}szl{\'o} Babai and Peter Kimmel and Satyanarayana V. Lokam},
title = {Simultaneous messages vs. communication},
booktitle = {Proc. 12th Symp. Theoretical Aspects of Comp. Sci. (STACS'95)},
year = {1995},
editor = {E. Mayr and C. Puech},
volume = {900},
series = {Lect. Notes in Comp. Sci.},
pages = {361--372},
address = {Munich},
publisher = {Springer},
keywords = {complexity, communication_complexity, lower_bounds, other_conf},
ranking = {044},
doi = {10.1007/3-540-59042-0_88}
}
@article{143,
author = {L{\'a}szl{\'o} Babai and Hunter Snevily and Richard M. Wilson},
title = {A new proof of several inequalities on codes and sets},
journal = {J. Combin. Theory Ser. A},
year = {1995},
volume = {71},
number = {1},
pages = {146--153},
keywords = {combinatorics, extremal_combinatorics, codes, combinatorics_journals},
ranking = {077},
doi = {10.1016/0097-3165(95)90021-7}
}
@article{144,
author = {L{\'a}szl{\'o} Babai and Gene Cooperman and Larry Finkelstein and Eugene M. Luks and {\'A}kos Seress},
title = {Fast {M}onte {C}arlo algorithms for permutation groups},
journal = {J. Comput. System Sci.},
year = {1995},
volume = {50},
number = {2},
pages = {296--308},
note = {Special issue; full version of item 1991.106},
keywords = {groups, algorithmic_group_theory, algorithms, random, special_issue},
ranking = {072},
doi = {10.1006/jcss.1995.1024}
}
@incollection{145,
author = {L{\'a}szl{\'o} Babai},
title = {Automorphism groups, isomorphism, reconstruction},
booktitle = {Handbook of Combinatorics},
publisher = {North-Holland -- Elsevier},
year = {1995},
editor = {R.~L. Graham and M. Gr{\"o}tschel and L. Lov{\'a}sz},
chapter = {27},
pages = {1447--1540},
keywords = {automorphisms, groups, symmetry, isomorphism, graph_isomorphism, survey},
ranking = {057},
eprint = {acm:233236}
}
@inproceedings{146,
author = {L{\'a}szl{\'o} Babai and Robert Beals and Jin{-}Yi Cai and G{\'a}bor Ivanyos and Eugene M. Luks},
title = {Multiplicative equations over commuting matrices},
booktitle = {Proc. 7th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'96)},
publisher = {SIAM},
year = {1996},
pages = {498--507},
keywords = {algorithmic_algebra, semigroups, algorithms, SODA},
ranking = {076},
eprint = {acm:314109}
}
@inproceedings{147,
author = {L{\'a}szl{\'o} Babai and Anna G{\'a}l and J{\'a}nos Koll{\'a}r and Lajos R{\'o}nyai and Tibor Szab{\'o} and Avi Wigderson},
title = {Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs},
booktitle = {Proc. 28th STOC},
publisher = {ACM Press},
year = {1996},
pages = {603--611},
keywords = {complexity, lower_bounds, combinatorics, extremal_combinatorics, STOC, STOC_FOCS},
ranking = {044},
doi = {10.1145/237814.238010}
}
@incollection{148,
author = {L{\'a}szl{\'o} Babai},
title = {In and Out of {H}ungary: {P}aul {E}rd{\H{o}}s, His Friends, and Times},
booktitle = {Combinatorics: {P}aul {E}rd{\H{o}}s Is Eighty},
publisher = {J. Bolyai Mathematical Society},
year = {1996},
editor = {D. Mikl{\'o}s and V.~T.~S{\'o}s and T.~Sz{\H{o}}nyi},
volume = {2},
series = {Bolyai Society Mathematical Studies},
pages = {7--95},
address = {Budapest},
keywords = {bio, erdos},
ranking = {043}
}
@article{149,
author = {L{\'a}szl{\'o} Babai},
title = {We stare in disbelief $\ldots$ (Untitled letter on
{P}aul {E}rd{\H{o}}s's passing)},
journal = {Combinatorica},
year = {1996},
volume = {16},
number = {4},
pages = {452},
keywords = {bio, erdos, combinatorics_journals},
ranking = {097},
doi = {10.1007/BF01271264}
}
@article{150,
author = {L{\'a}szl{\'o} Babai},
title = {{P}aul {E}rd{\H{o}}s (1913-1996)},
journal = {SIGACT News},
year = {1996},
volume = {27},
number = {4},
pages = {62--65},
keywords = {bio, erdos},
ranking = {112},
doi = {10.1145/242581.242586}
}
@article{151,
author = {L{\'a}szl{\'o} Babai},
title = {Poczta komputerowa i niezwyk{\l}a moc interakcji},
journal = {Wiadomo{\'s}ci Matematyczne},
year = {1995},
volume = {XXXI},
pages = {55--80},
note = {Polish translation of item 1990.98. Appeared Sep. 1996.},
keywords = {complexity, interactive_proofs, popular},
ranking = {063}
}
@inproceedings{152,
author = {L{\'a}szl{\'o} Babai},
title = {The growth rate of vertex-transitive planar graphs},
booktitle = {Proc. 8th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'97)},
publisher = {SIAM},
year = {1997},
pages = {564--573},
address = {New Orleans LA},
organization = {ACM--SIAM},
keywords = {automorphisms, vertex-transitive_graphs, symmetry, topological_graph_theory, combinatorics, SODA},
ranking = {071},
eprint = {acm:314390}
}
@inproceedings{153,
author = {L{\'a}szl{\'o} Babai},
title = {Randomization in group algorithms: {C}onceptual questions},
booktitle = {``Groups and Computation II''},
year = {1997},
editor = {L. Finkelstein and W. M. Kantor},
volume = {28},
series = {DIMACS Ser. in Discr. Math. and Theor. Comp. Sci.},
pages = {1--16},
publisher = {Amer. Math. Soc.},
note = {Workshop on groups and computation, June 7-10, 1995.},
keywords = {groups, algorithmic_group_theory, algorithms, random},
ranking = {073}
}
@article{154,
author = {L{\'a}szl{\'o} Babai},
title = {{P}aul {E}rd{\H{o}}s and His Influence on the Theory of Computing},
journal = {SIAM News},
year = {1997},
volume = {30},
number = {1},
pages = {3},
keywords = {bio, erdos, combinatorics, algorithms, complexity},
ranking = {083}
}
@inproceedings{155,
author = {L{\'a}szl{\'o} Babai},
title = {{P}aul {E}rd{\H{o}}s (1913--1996): {H}is Influence on the Theory of Computing},
booktitle = {Proc. 29th STOC},
publisher = {ACM Press},
year = {1997},
pages = {383--401},
keywords = {bio, erdos, survey, combinatorics, algorithms, complexity},
ranking = {045},
doi = {10.1145/258533.258624}
}
@inproceedings{156,
author = {L{\'a}szl{\'o} Babai and Peter Kimmel},
title = {Randomized simultaneous messages: {S}olution of a problem of {Y}ao in communication complexity},
booktitle = {Proc. 12th IEEE Conf. on Computational Complexity (CCC'97)},
publisher = {IEEE Comp. Soc. Press},
year = {1997},
pages = {239--246},
keywords = {complexity, communication_complexity, lower_bounds, random, other_conf},
ranking = {061},
doi = {10.1109/CCC.1997.612319}
}
@article{157,
author = {L{\'a}szl{\'o} Babai and Albert J. Goodman and William M. Kantor and Eugene M. Luks and P{\'e}ter P. P{\'a}lfy},
title = {Short presentations for finite groups},
journal = {J. Algebra},
year = {1997},
volume = {194},
number = {1},
pages = {79--112},
keywords = {groups, asymptotic_group_theory, motivated_by, JAlg},
ranking = {028},
doi = {10.1006/jabr.1996.6980}
}
@article{158,
author = {L{\'a}szl{\'o} Babai and Albert J. Goodman and L{\'a}szl{\'o} Pyber},
title = {Groups without faithful transitive permutation representations of small degree.},
journal = {J. Algebra},
year = {1997},
volume = {195},
number = {1},
pages = {1--29},
keywords = {groups, permutation_groups, asymptotic_group_theory, JAlg},
ranking = {068},
doi = {10.1006/jabr.1997.7042}
}
@article{159,
author = {L{\'a}szl{\'o} Babai and Eugene M. Luks and {\'A}kos Seress},
title = {Fast management of permutation groups {I}},
journal = {SIAM J. Comput.},
year = {1997},
volume = {26},
number = {5},
pages = {1310--1342},
note = {Full version of 1988.91.},
keywords = {groups, algorithmic_group_theory, algorithms, permutation_groups},
ranking = {078},
doi = {10.1137/S0097539794229417}
}
@article{160,
author = {Sanjeev Arora and L{\'a}szl{\'o} Babai and Jacques Stern and Z. (Elizabeth) Sweedyk},
title = {The hardness of approximate optima in lattices, codes, and systems of linear equations},
journal = {J. Comput. System Sci.},
year = {1997},
volume = {54},
number = {2},
pages = {317--331},
note = {Full version of 1993.136.},
keywords = {complexity, interactive_proofs, inapproximability, codes, lattice_vector, spec_issue},
ranking = {026},
doi = {10.1006/jcss.1997.1472}
}
@inproceedings{161,
author = {L{\'a}szl{\'o} Babai},
title = {Communication complexity},
booktitle = {Proc. 22nd Internat. Symp. on Math. Foundations of Computer Science (MFCS'97)},
year = {1997},
editor = {I. Pr{\'\i}vara and P. Ru{\v z}i{\v c}ka},
volume = {1295},
series = {Lecture Notes in Computer Science},
pages = {5--18},
publisher = {Springer},
keywords = {complexity, communication_complexity, lower_bounds, survey},
ranking = {126},
doi = {10.1007/BFb0029945}
}
@article{162,
author = {L{\'a}szl{\'o} Babai (organizer) and Carl Pomerance and P{\'e}ter V{\'e}rtesi},
title = {The mathematics of {P}aul {E}rd{\H{o}}s},
journal = {Notices Amer. Math. Soc.},
year = {1998},
volume = {45},
number = {1},
pages = {19--31},
month = {January},
keywords = {bio, erdos},
ranking = {044},
url = {http://www.ams.org/notices/199801/vertesi.pdf}
}
@article{163,
author = {L{\'a}szl{\'o} Babai},
title = {Finite and Transfinite Combinatorics},
journal = {Notices Amer. Math. Soc.},
year = {1998},
volume = {45},
number = {1},
pages = {23--28},
month = {January},
note = {Part of item 1998.162.},
keywords = {bio, erdos},
ranking = {044},
url = {http://www.ams.org/notices/199801/vertesi.pdf}
}
@article{164,
author = {L{\'a}szl{\'o} Babai and Joel H. Spencer},
title = {{P}aul {E}rd{\H{o}}s (1913--1996)},
journal = {Notices Amer. Math. Soc.},
year = {1998},
volume = {45},
number = {1},
pages = {64--73},
month = {January},
keywords = {bio, erdos},
ranking = {044},
url = {http://www.ams.org/notices/199801/comm-erdos.pdf}
}
@article{165,
author = {L{\'a}szl{\'o} Babai},
title = {{P}aul {E}rd{\H{o}}s just left town.},
journal = {Notices Amer. Math. Soc.},
year = {1998},
volume = {45},
number = {1},
pages = {66--73},
month = {January},
note = {Part of item 1998.164.},
keywords = {bio, erdos},
ranking = {074},
url = {http://www.ams.org/notices/199801/comm-erdos.pdf}
}
@incollection{166,
author = {L{\'a}szl{\'o} Babai},
title = {The Forbidden Sidetrip},
editor = {C.~S. Calude},
booktitle = {People \&\ Ideas in Theoretical Computer Science},
pages = {1--31},
publisher = {Springer},
year = {1998},
keywords = {autobio},
ranking = {144},
eprint = {acm:522174}
}
@inproceedings{167,
author = {L{\'a}szl{\'o} Babai and Thomas Hayes and Peter Kimmel},
title = {The cost of the missing bit: {C}ommunication complexity with help},
booktitle = {Proc. 30th STOC},
publisher = {ACM Press},
year = {1998},
pages = {673--682},
keywords = {complexity, lower_bounds, communication_complexity, STOC, STOC_FOCS},
ranking = {043},
doi = {10.1145/276698.276883},
note = {Conference version of item 2001:177}
}
@article{168,
author = {L{\'a}szl{\'o} Babai},
title = {Magyarorsz{\'a}gon {\'e}s a vil{\'a}gban: {E}rd{\H{o}}s {P}{\'a}l, bar{\'a}tai, {\'e}s kora},
journal = {Term{\'e}szet Vil{\'a}ga},
year = {1998},
volume = {129},
number = {3},
pages = {31--36},
note = {Hungarian translation of parts of item 1996.148.},
keywords = {bio, erdos},
ranking = {043}
}
@incollection{169,
author = {L{\'a}szl{\'o} Babai and Robert Beals},
title = {A polynomial-time theory of black box groups {I}},
booktitle = {{G}roups {S}t {A}ndrews 1997 in {B}ath, {I}},
publisher = {Cambr. U. Press},
year = {1999},
editor = {C.M. Campbell and E.F. Robertson and N. Ruskuc and G. C. Smith},
series = {London Math. Soc. Lect. Notes},
pages = {30--64},
url = {http://people.cs.uchicago.edu/~laci/papers/bath1.pdf},
keywords = {groups, algorithmic_group_theory, matrix_groups, asymptotic_group_theory},
ranking = {031}
}
@article{170,
author = {L{\'a}szl{\'o} Babai and Anna G{\'a}l and Avi Wigderson},
title = {Superpolynomial lower bounds for monotone span programs},
journal = {Combinatorica},
year = {1999},
volume = {19},
number = {3},
pages = {301--319},
note = {Expanded version of part of item 2001.147.},
url = {http://people.cs.uchicago.edu/~laci/papers/span1.pdf},
keywords = {complexity, lower_bounds, combinatorics_journals},
ranking = {044},
doi = {10.1007/s004930050058}
}
@inproceedings{171,
author = {L{\'a}szl{\'o} Babai and Sophie Laplante},
title = {Stronger separations for random-self-reducibility, rounds, and advice},
booktitle = {Proc. 14th IEEE Conf. on Computational Complexity (CCC'99)},
publisher = {IEEE Comp. Soc. Press},
year = {1999},
pages = {98--104},
organization = {IEEE Comp. Soc.},
keywords = {complexity, lower_bounds, other_conf},
ranking = {091},
doi = {10.1109/CCC.1999.766268}
}
@inproceedings{172,
author = {L{\'a}szl{\'o} Babai and Igor Pak},
title = {Strong bias of group generators: {A}n obstacle to the ``product replacement algorithm.''},
booktitle = {Proc. 11th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'00)},
publisher = {SIAM},
year = {2000},
pages = {627--635},
address = {San Francisco CA},
organization = {ACM--SIAM},
keywords = {groups, algorithmic_group_theory, algorithms, asymptotic_group_theory, SODA},
ranking = {077},
eprint = {acm:338616},
note = {Conference version of 2004:181}
}
@article{173,
author = {L{\'a}szl{\'o} Babai and Peter J. Cameron},
title = {Automorphisms and enumeration of switching classes of tournaments},
journal = {Electronic J. of Combinatorics},
year = {2000},
volume = {7},
pages = {R38 (24 pp.)},
keywords = {groups, automorphisms, combinatorics, combinatorics_journals, random},
ranking = {083},
url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v7i1r38}
}
@inproceedings{174,
author = {L{\'a}szl{\'o} Babai and Aner Shalev},
title = {Recognizing simplicity of black-box groups and the frequency of $p$-singular elements in affine groups},
booktitle = {Groups and Computation III. Proc. 1999 Workshop at the Ohio State University},
year = {2001},
editor = {W.~M. Kantor and {\'A}kos Seress},
pages = {39--62},
address = {Berlin-New York},
publisher = {Ohio State University Mathematical Research Institute Publications, deGruyter},
url = {http://people.cs.uchicago.edu/~laci/papers/bsh-unisingular.pdf},
keywords = {groups, algorithmic_group_theory, asymptotic_group_theory},
ranking = {074}
}
@article{175,
author = {Lajos R{\'o}nyai and L{\'a}szl{\'o} Babai and Murali K. Ganapathy},
title = {On the number of zero-patterns of a sequence of polynomials},
journal = {J. Amer. Math. Soc.},
year = {2001},
volume = {14},
number = {3},
pages = {717--735},
url = {http://people.cs.uchicago.edu/~laci/papers/zero.pdf},
keywords = {combinatorics, extremal_combinatorics, polynomials, pr},
ranking = {029},
doi = {10.1090/S0894-0347-01-00367-8}
}
@article{176,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter Frankl and Samuel Kutin and Daniel {\v S}tefankovi{\v c}},
title = {Set systems with restricted intersections modulo prime powers},
journal = {J. Combin. Theory Ser. A},
year = {2001},
volume = {95},
number = {1},
pages = {39--73},
url = {http://people.cs.uchicago.edu/~laci/papers/bfks1.pdf},
keywords = {combinatorics, extremal_combinatorics, combinatorics_journals},
ranking = {037},
doi = {10.1006/jcta.2000.3149}
}
@article{177,
author = {L{\'a}szl{\'o} Babai and Thomas Hayes and Peter Kimmel},
title = {The cost of the missing bit: {C}ommunication complexity with help},
journal = {Combinatorica},
year = {2001},
volume = {21},
number = {4},
pages = {455--488},
note = {Expanded version of item 1998.167.},
url = {http://people.cs.uchicago.edu/~laci/papers/missingbit1.pdf},
keywords = {complexity, lower_bounds, communication_complexity, combinatorics_journals},
ranking = {043},
doi = {10.1007/s004930100009}
}
@article{178,
author = {L{\'a}szl{\'o} Babai and William M. Kantor and P{\'e}ter P. P{\'a}lfy and {\'A}kos Seress},
title = {Black-box recognition of finite simple groups of {L}ie type by statistics of element orders},
journal = {J. Group Theory},
year = {2002},
volume = {5},
number = {4},
pages = {383--401},
url = {http://people.cs.uchicago.edu/~laci/papers/bkps.pdf},
keywords = {groups, algorithmic_group_theory, asymptotic_group_theory, motivated_by},
ranking = {033},
doi = {10.1515/jgth.2002.010}
}
@inproceedings{179,
author = {L{\'a}szl{\'o} Babai and Amir Shpilka and Daniel {\v S}tefankovi{\v c}},
title = {Locally testable cyclic codes},
booktitle = {Proc. 44th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {2003},
pages = {116--125},
note = {Conference version of item 2005:185},
keywords = {complexity, lower_bounds, codes, FOCS, STOC_FOCS},
ranking = {040},
doi = {10.1109/SFCS.2003.1238186}
}
@inproceedings{180,
author = {L{\'a}szl{\'o} Babai and Robert Beals and {\'A}kos Seress},
title = {On the diameter of the symmetric group: {P}olynomial bounds},
booktitle = {Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'04)},
publisher = {SIAM},
year = {2004},
pages = {1108-1112},
organization = {ACM--SIAM},
keywords = {algorithmic group theory, algorithms, combinatorics, diameter, inspire},
ranking = {032},
eprint = {acm:982956}
}
@article{181,
author = {L{\'a}szl{\'o} Babai and Igor Pak},
title = {Strong bias of group generators: {A}n obstacle to the ``product replacement algorithm''},
journal = {J. Algorithms},
year = {2004},
volume = {50},
number = {2},
pages = {215--231},
note = {Journal version of item 2000.172.},
url = {http://people.cs.uchicago.edu/~laci/papers/b-pak.pdf},
keywords = {algorithmic group theory, algorithms},
ranking = {077},
doi = {10.1016/S0196-6774(03)00091-9}
}
@inproceedings{182,
author = {L{\'a}szl{\'o} Babai and Daniel {\v S}tefankovi{\v c}},
title = {Simultaneous {D}iophantine Approximation with Excluded Primes},
booktitle = {Proc. 15th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'04)},
publisher = {SIAM},
year = {2004},
pages = {1123-1129},
organization = {ACM--SIAM },
url = {http://people.cs.uchicago.edu/~laci/papers/excl-primes-soda04.pdf},
keywords = {algorithms, lattice_vector, SODA},
ranking = {067},
eprint = {acm:982958}
}
@article{183,
author = {L{\'a}szl{\'o} Babai and Anna G{\'a}l and Peter Kimmel and Satyanarayana V. Lokam},
title = {Communication Complexity of Simultaneous Messages},
journal = {SIAM J. Comput.},
year = {2004},
volume = {33},
number = {1},
pages = {137--166},
note = {Greatly expanded version of 1995.142.},
url = {http://people.cs.uchicago.edu/~laci/papers/bgkl-SM.pdf},
keywords = {complexity, communication_complexity, lower_bounds},
ranking = {044},
doi = {10.1137/S0097539700375944}
}
@inproceedings{184,
author = {L{\'a}szl{\'o} Babai and Thomas Hayes},
title = {Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group},
booktitle = {Proc. 16th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'05)},
publisher = {SIAM},
year = {2005},
organization = {ACM--SIAM},
pages = {1057-1066},
url = {http://people.cs.uchicago.edu/~laci/papers/bhayes-diam-soda.pdf},
keywords = {algorithmic group theory, algorithms, combinatorics, diameter},
ranking = {043},
eprint = {acm:1070584}
}
@article{185,
author = {L{\'a}szl{\'o} Babai and Amir Shpilka and Daniel {\v S}tefankovi{\v c}},
title = {Locally testable cyclic codes},
journal = {IEEE Trans. Inform. Theory},
volume = {51},
number = {8},
year = {2005},
pages = {2849-2858},
note = {Journal version of 2003.179.},
url = {http://people.cs.uchicago.edu/~laci/papers/b-shp-ste.pdf},
keywords = {complexity, lower_bounds, codes},
ranking = {040},
doi = {10.1109/TIT.2005.851735}
}
@inproceedings{186,
author = {L{\'a}szl{\'o} Babai},
title = {On the diameter of {E}ulerian orientations of graphs},
booktitle = {Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'06)},
publisher = {ACM Press},
year = {2006},
pages = {822--831},
organization = {ACM--SIAM},
url = {http://people.cs.uchicago.edu/~laci/papers/eulerian-soda06.pdf},
keywords = {algorithms},
ranking = {047},
doi = {10.1145/1109557.1109648}
}
@article{187,
author = {L{\'a}szl{\'o} Babai},
title = {Guest {E}ditor's {F}oreword to the {S}pecial {I}ssue Dedicated to the 40th {ACM} {S}ymposium on {T}heory of {C}omputing},
journal = {SIAM J. Comput.},
volume = {35},
number = {4},
year = {2006},
pages = {ix-x},
keywords = {foreword},
ranking = {099},
doi = {10.1137/SMJCAT0000350000040000ix000001}
}
@article{188,
author = {L{\'a}szl{\'o} Babai and Thomas Hayes},
title = {The probability of generating the symmetric group when one of the generators is random},
journal = {Publ. Math. Debrecen},
volume = {69},
number = {3},
year = {2006},
pages = {271--280},
url = {http://people.cs.uchicago.edu/~laci/papers/debrecen.pdf},
keywords = {groups},
ranking = {079}
}
@inproceedings{189,
author = {L{\'a}szl{\'o} Babai and Igor Gorodezky},
title = {Sandpile transience on the grid is polynomially bounded},
booktitle = {Proc. 18th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'07)},
publisher = {SIAM},
year = {2007},
pages = {627--636},
organization = {ACM--SIAM},
url = {http://people.cs.uchicago.edu/~laci/papers/bg-sandpile-soda07.pdf},
keywords = {algorithms, combinatorics, sandpile},
ranking = {064},
eprint = {acm:1283451}
}
@article{190,
author = {Mikl{\'o}s Ab{\'e}rt and L{\'a}szl{\'o} Babai},
title = {Finite groups of uniform logarithmic diameter},
journal = {Israel J. Math},
volume = {158},
number = {1},
pages = {193--203},
year = {2007},
url = {http://people.cs.uchicago.edu/~laci/papers/ab-diam.pdf},
keywords = {groups, asymptotic_group_theory, diameter},
ranking = {073},
doi = {10.1007/s11856-007-0009-7}
}
@inproceedings{191,
author = {L{\'a}szl{\'o} Babai and Nikolai Nikolov and L{\'a}szl{\'o} Pyber},
title = {Product growth and mixing in finite groups},
booktitle = {Proc. 19th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'08)},
year = {2008},
pages = {248--257},
organization = {ACM--SIAM},
publisher = {SIAM},
note = {Full paper in preparation},
url = {http://people.cs.uchicago.edu/~laci/papers/bnp-soda08.pdf},
keywords = {groups, algorithms, combinatorics},
ranking = {037},
eprint = {acm:1347082.1347110}
}
@inproceedings{192,
author = {L{\'a}szl{\'o} Babai and Paolo Codenotti},
title = {Isomorphism of hypergraphs of low rank in moderately exponential time},
booktitle = {Proc. 49th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {2008},
pages = {667--676},
note = {NSF Grant CCF-0830370},
grant = {CCF-0830370},
url = {http://people.cs.uchicago.edu/~laci/papers/hypergraphiso.pdf},
keywords = {algorithms, isomorphism, graph_isomorphism, FOCS, STOC_FOCS},
ranking = {038},
doi = {10.1109/FOCS.2008.80}
}
@article{193,
author = {L{\'a}szl{\'o} Babai and P{\'e}ter P. P{\'a}lfy and Jan Saxl},
title = {On the number of $p$-regular elements in finite simple groups},
journal = {LMS Journal of Computation and Mathematics},
volume = {12},
year = {2009},
pages = {82--119},
note = {NSF Grants CCR-9732205 and CCF-0830370},
grant = {CCR-9732205, CCF-0830370},
url = {http://old.lms.ac.uk/jcm/12/lms2007-039},
keywords = {groups, asymptotic_group_theory, statistical_group_theory, matrix_groups, motivated_by},
ranking = {039},
doi = {10.1112/S1461157000000036}
}
@inproceedings{194,
author = {L{\'a}szl{\'o} Babai and Robert Beals and {\'A}kos Seress},
title = {Polynomial-time theory of matrix groups},
booktitle = {Proc. 41st STOC},
publisher = {ACM Press},
year = {2009},
pages = {55--64},
note = {NSF Grant CCF-0830370},
grant = {CCF-0830370},
url = {http://people.cs.uchicago.edu/~laci/papers/09matrix.pdf},
keywords = {groups, algorithmic_group_theory, algorithms, matrix_groups, random, STOC, STOC_FOCS},
ranking = {038},
doi = {10.1145/1536414.1536425}
}
@article{195,
author = {L{\'a}szl{\'o} Babai and Barry Guiduli},
title = {Spectral extrema for graphs: the {Z}arankiewicz problem},
journal = {Electronic J. of Combinatorics},
volume = {16},
number = {1},
year = {2009},
month = {September},
pages = {R123 (8pp)},
url = {http://www.combinatorics.org/ojs/index.php/eljc/article/view/v16i1r123},
keywords = {combinatorics, extremal_combinatorics, spectrum, combinatorics_journals},
ranking = {047}
}
@comment{{rankings to this point}}
@article{196,
author = {L{\'a}szl{\'o} Babai and Pedro Felzenszwalb},
title = {Computing rank-convolutions with a mask},
journal = {ACM Trans. Algorithms},
volume = {6},
number = {1},
year = {2009},
pages = {20:1--20:13},
url = {http://people.cs.uchicago.edu/~laci/papers/conv.pdf},
keywords = {algorithms, algorithmic_algebra, image_processing},
ranking = {061},
doi = {10.1145/1644015.1644035}
}
@inproceedings{197,
author = {L{\'a}szl{\'o} Babai and Anandam Banerjee and Raghav Kulkarni and Vipul Naik},
title = {Evasiveness and the distribution of prime numbers},
booktitle = {Proc. 27th Ann. Symp. on Theoretical Aspects of Comp. Sci. (STACS 2010)},
publisher = {Schloss Dagstuhl Online Publ.},
year = {2010},
pages = {71--82},
note = {NSF Grant CCF-0830370},
grant = {CCF-0830370},
keywords = {complexity, lower_bounds, groups, permutation_groups, topology, other_conf},
ranking = {078},
doi = {10.4230/LIPIcs.STACS.2010.2445}
}
@inproceedings{198,
author = {L{\'a}szl{\'o} Babai and Kristoffer Arnsfelt Hansen and Vladimir V. Podolskii and Xiaoming Sun},
title = {Weights of exact threshold functions},
booktitle = {Proc. 35th Internat. Symp. on Math. Foundations of Computer Science (MFCS'10)},
publisher = {Springer},
year = {2010},
pages = {66--77},
url = {http://people.cs.uchicago.edu/~laci/papers/threshold.pdf},
keywords = {complexity, lower_bounds, other_conf},
ranking = {088},
doi = {10.1007/978-3-642-15155-2_8}
}
@inproceedings{199,
author = {L{\'a}szl{\'o} Babai and Paolo Codenotti and Joshua Grochow and Youming Qiao},
title = {Code equivalence and group isomorphism},
booktitle = {Proc. 22nd Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA'11)},
organization = {ACM--SIAM},
publisher = {SIAM},
year = {2011},
pages = {1395--1408},
note = {NSF Grant CCF-0830370},
grant = {CCF-0830370},
url = {http://people.cs.uchicago.edu/~laci/papers/soda11.pdf},
keywords = {groups, isomorphism, group_isomorphism, algorithms, algorithmic_group_theory, codes, SODA},
ranking = {070},
eprint = {acm:2133143}
}
@incollection{200,
author = {L{\'a}szl{\'o} Babai},
title = {Finite Groups and Complexity Theory: {F}rom {L}eningrad to {S}aint {P}etersburg via {L}as {V}egas},
editor = {A. Kulikov and N. Vereshchagin},
booktitle = {Proc. 6th Internat. Computer Science Symp. in Russia (CSR'11)},
publisher = {Springer},
series = {LNCS},
volume = {6651},
pages = {162--180},
year = {2011},
keywords = {autobio, survey, groups, algorithms, complexity, isomorphism, graph_isomorphism, algorithmic_group_theory, other_conf},
ranking = {101},
doi = {10.1007/978-3-642-20712-9_13}
}
@inproceedings{201,
title = {Polynomial-time Isomorphism Test for Groups with Abelian {S}ylow Towers},
author = {L{\'a}szl{\'o} Babai and Youming Qiao},
booktitle = {Proc. 29th Symp. Theoretical Aspects of Comp. Sci. (STACS'12)},
publisher = {Schloss Dagstuhl Online Publ.},
year = {2012},
pages = {453--464},
keywords = {groups, isomorphism, group_isomorphism, algorithms, algorithmic_group_theory, other_conf},
ranking = {069},
doi = {10.4230/LIPIcs.STACS.2012.453}
}
@inproceedings{202,
title = {Polynomial-time Isomorphism Test for Groups with no
Abelian Normal Subgroups (Extended Abstract)},
author = {L{\'a}szl{\'o} Babai and Paolo Codenotti and Youming Qiao},
booktitle = {Proc. 39th Internat. Colloq. on Automata, Languages and Programming (ICALP'12)},
publisher = {Springer},
year = {2012},
pages = {51--62},
doi = {10.1007/978-3-642-31594-7_5},
keywords = {groups, isomorphism, group_isomorphism, algorithms, algorithmic_group_theory, asymptotic_group_theory, permutation_groups, codes, other_conf},
ranking = {059}
}
@inproceedings{203,
title = {Quasipolynomial-Time Canonical Form for {S}teiner Designs},
author = {L{\'a}szl{\'o} Babai and John Wilmes},
booktitle = {Proc. 45th STOC},
publisher = {ACM Press},
year = {2013},
pages = {261--270},
keywords = {algorithms, isomorphism, graph_isomorphism, automorphisms, highly_regular, combinatorics, random, STOC, STOC_FOCS},
ranking = {043},
doi = {10.1145/2488608.2488642}
}
@inproceedings{204,
title = {Faster Canonical Forms for Strongly Regular Graphs (Extended Abstract)},
author = {L{\'a}szl{\'o} Babai and Xi Chen and Xiaorui Sun and Shang-Hua Teng and John Wilmes},
booktitle = {Proc. 54th FOCS},
publisher = {IEEE Comp. Soc. Press},
year = {2013},
pages = {},
keywords = {groups, algorithms, isomorphism, graph_isomorphism, automorphisms, highly_regular, combinatorics, random, FOCS, STOC_FOCS},
ranking = {039}
}
This file was generated by bibtex2html 1.91.