[1]	László Babai. Coloring infinite graphs (Hungarian). Matematikai Lapok, 20:141-143, 1969.
[2]	László Babai. Representation of permutation groups by graphs. In Pál Erdős et al., editor, Combinatorial Theory and its Applications, Proc. Conf. Balatonfüred, 1969, pages 55-80, Hungary, 1970. Bolyai, North-Holland.
[3]	László Babai. Automorphism groups of planar graphs I. Discrete Math., 2:285-307, 1972.
[4]	László Babai. Groups of graphs on given surfaces. Acta Math. Acad. Sci. Hung., 24:215-221, 1973.
[5]	László Babai and Wilfried Imrich. On groups of polyhedral graphs. Discrete Math., 5:101-103, 1973.
[6]	László Babai and László Lovász. Permutation groups and almost regular graphs. Studia Sci. Math. Hung., 8:141-150, 1973.
[7]	László Babai, Wilfried Imrich, and László Lovász. Finite homeomorphism groups of the 2-sphere. In Á. Császár, editor, Topics in Topology, Proc. Conf. Keszthely, 1972, pages 61-75, Hungary, 1973. Bolyai, North-Holland.
[8]	László Babai and Attila Máté. Inner set mappings on locally compact spaces. In Á. Császár, editor, Topics in Topology, Proc. Conf. Keszthely, Hungary 1972, pages 77-95, Hungary, 1973. Bolyai, North-Holland.
[9]	László Babai. Automorphism groups of graphs and edge-contraction. Discrete Math., 8:13-20, 1974.
[10]	László Babai. A remark on contraction of graphs with given group. Acta Math. Acad. Sci. Hung., 25:89-91, 1974.
[11]	László Babai. On the minimum order of graphs with given group. Canad. Math. Bull., 17:467-470, 1974.
[12]	László Babai. Automorphism groups of planar graphs II. In A. Hajnal et al., editor, Infinite and finite sets, Proc. Conf. Keszthely, Hungary, 1973, pages 29-84, Hungary, 1975. Bolyai, North-Holland.
[13]	László Babai and Wilfried Imrich. Sense preserving groups of polyhedral graphs. Monatshefte Math., 79:1-2, 1975.
[14]	László Babai. Automorphism groups of graphs. Ph.d. thesis, Hungary, 1975. In Hungarian, 308 pages.
[15]	László Babai. Asymmetric trees with two prescribed degrees. Acta Math. Acad. Sci. Hung., 28:193-200, 1977.
[16]	László Babai. Some applications of graph contractions. J. of Graph Theory, 1:125-130, 1977.
[17]	László Babai. Isomorphism problem for a class of point symmetric structures. Acta Math. Acad. Sci. Hung., 29:329-336, 1977.
[18]	László Babai. On the collineation groups of infinite projective and affine planes. J. of Geometry, 10:138-145, 1977.
[19]	László Babai. Symmetry groups of vertex transitive polytopes. Geometriae Dedicata, 6:331-338, 1977.
[20]	László Babai. On the isomorphism problem. In Proc. Conf. FCT'77 (Fundamentals of Computation Theory), page 10. Poznan-Kornik, 1977. Article was appended to this publication.
[21]	László Babai. Chromatic number and subgraphs of Cayley graphs. In Y. Alavi and D.R. Lick, editors, Theory and Appl. of Graphs, volume 642 of Lecture Notes in Math., pages 10-22. Springer, 1978.
[22]	László Babai. Automorphism group and category of cospectral graphs. Acta Math. Acad. Sci. Hung., 31:295-306, 1978.
[23]	László Babai and Péter Frankl. Isomorphisms of Cayley graphs i. In A. Hajnal and Vera T. Sós, editors, Combinatorics (Proc. Conf. Keszthely, Hungary, 1976), pages 35-52. Bolyai, North-Holland, 1978.
[24]	László Babai and Jaroslav Nešet ril. High chromatic rigid graphs I. In A. Hajnal and Vera T. Sós, editors, Combinatorics (Proc. Conf. Keszthely, Hungary, 1976), pages 53-60. Bolyai, North-Holland, 1978.
[25]	László Babai. Embedding graphs in Cayley graphs. In J-C. Bermond et al., editor, Probl. Combinatoires et Theorie des Graphes (Proc. Conf. Paris-Orsay 1976), pages 13-15, Paris, 1978. Centre National de Rech. Sci.
[26]	László Babai and Péter Frankl. Infinite quasigroups with given regular automorphism groups. Algebra Universalis, 8:310-319, 1978.
[27]	László Babai. Infinite digraphs with given regular automorphism groups. J. Combinatorial Theory - B, 25:26-46, 1978.
[28]	László Babai and Francis J. Pastijn. On semigroups with high symmetry. Simon Stevin, 52:73-84, 1978.
[29]	László Babai. On a conjecture of m.e. Watkins on graphical regular representations of finite groups. Compositio Math., 37:291-296, 1978.
[30]	László Babai. Vector representable matroids of given rank with given automorphism group. Discrete Math., 24:119-125, 1978.
[31]	László Babai. Tournaments with given (infinite) automorphism group. Periodica Math. Hung., 10:99-104, 1979.
[32]	László Babai. Endomorphisms of sub- and factorsemigroups. In G. Pollák, editor, Algebraic theory of semigroups (Proc. Conf. Szeged, 1976), volume 20, pages 43-50. Colloq. Math. Soc. J. Bolyai, Bolyai - North-Holland, 1979.
[33]	László Babai, Péter Frankl, János Kollár, and Gert Sabidussi. Hamiltonian cubic graphs and centralizers of involutions. Canad. J. Math., 31:458-464, 1979.
[34]	László Babai and Luděk Kučera. Canonical labelling of graphs in linear average time. In Proc. 20th Ann. IEEE Symp. on Foundations of Comp. Sci., pages 39-46. IEEE, 1979.
[35]	László Babai. Monte Carlo algorithms in graph isomorphism testing. Tech. Rep. 79-10, Université de Montréal, 1979. 42 pages.
[36]	László Babai. Long cycles in vertex transitive graphs. J. Graph Theory, 3:301-304, 1979.
[37]	László Babai. Spectra of Cayley graphs. J. Comb. Theory B, 27:180-189, 1979.
[38]	László Babai and Wilfried Imrich. Tournaments with given regular group. Aequationes Math., 19:232-244, 1979.
[39]	László Babai and Péter Frankl. Isomorphisms of Cayley graphs ii. Acta Math. Acad. Sci. Hung., 34:177-183, 1979.
[40]	László Babai. On the complexity of canonical labelling of strongly regular graphs. SIAM J. on Computing, 9:212-216, 1980.
[41]	László Babai and Péter Frankl. On set-intersections. J. Comb. Th.-A, 28:103-105, 1980.
[42]	Mark E. Watkins László Babai. Connectivity of infinite graphs having a transitive torsion group action. Archiv der Math., 34:90-96, 1980.
[43]	László Babai, Pál Erdős, and Stanley M. Selkow. Random graphs isomorphism. SIAM J. on Computing, 9:628-635, 1980.
[44]	László Babai. Almost all Steiner triple systems are asymmetric. Annals of Discrete Math., 7:37-39, 1980. Part of “Topics on Steiner Systems” (C.C. Lindner and A. Rosa, eds.).
[45]	László Babai and Aleš Pultr. Endomorphism monoids and topological subgraphs of graphs. J. Comb. Theory-B, 28:278-283, 1980.
[46]	László Babai. Two remarks on the complexity of graph isomorphism testing. In P.Z. Chinn and D. McCarthy, editors, Proc. West Coast Conf. on Combinatorics, Graph Th. and Computing, Humboldt State University 1979, pages 95-99, Winnipeg, 1980. Utilitas Math.
[47]	László Babai. Finite digraphs with given regular automorphism groups. Periodica Math. Hung., 11:257-270, 1980.
[48]	László Babai. Isomorphism testing and symmetry of graphs I. Annals of Discrete Math., 8:101-109, 1980. Part of “Combinatorics 79” (M. Deza and I.G. Rosenberg, eds.).
[49]	M.E.* Adams, László Babai, and Jiři Sichler. Automorphism groups of finite distributive lattices with a given sublattice of fixed points. Monatsh. Math., 90:256-266, 1980.
[50]	László Babai. Kospektrale Graphen mit vorgegebenen Automorphismengruppen. Wissenschaftliche Zeitschr. der Technischen Hochschule Ilmenau, 27(4):31-37, 1981.
[51]	László Babai. Some problems on lattice automorphisms. Studia Sci. Math. Hung., 13:139 - 142, 1978.
[52]	László Babai. On the abstract group of automorphisms. In H.N.V. Temperley, editor, Combinatorics(Proc. 8th British Combinatorial Conf., Swansea 1981), volume 52 of Lecture Note, pages 1-40. London Math. Soc., Cambridge Univ. Press, 1981.
[53]	László Babai. On the order of uniprimitive permutation groups. Annals of Mathematics, 113:553-568, 1981.
[54]	László Babai. Moderately exponential bound for graph isomorphism. In Gécseg, editor, Fundamentals of Computation Theory (Proc. Conf. FCT'81, Szeged), volume 117 of Lecture Notes in Computer Science, pages 34-50. Springer, 1981.
[55]	László Babai and Dwight Duffus. Dimension and automorphism groups of lattices. Algebra Universalis, 12:279 - 289, 1981.
[56]	László Babai. On strong embeddings of categories. In B. Csákány and E.T. Schmidt, editors, Universal Algebra (Proc. Conf. Esztergom 1977), volume 29, pages 37-51. Coll. Math. Soc. J. Bolyai, North-Holland, 1981.
[57]	László Babai, Peter J. Cameron, Michel Deza, and N.M. Singhi. On sharply edge-transitive permutation groups. J. Algebra, 73:573-585, 1981.
[58]	László Babai. Prí mszámok és titkosí rás (prime numbers and cryptography). Természet Világa, 112(6):250-253, 1981. In Hungarian.
[59]	László Babai. On the order of doubly transitive permutation groups. Inventiones Math., 65:473 - 484, 1982.
[60]	László Babai and C.D. Godsil. On the automorphism groups of almost all Cayley graphs. Eur. J. Comb., 3:6 - 15, 1982.
[61]	László Babai and Jaroslav Nešet ril. High chromatic rigid graphs II. Annals of Discr. Math., 15:55 - 61, 1982. In “Algebraic and Geometric Combinatorics” (E. Mendelsohn ed.).
[62]	László Babai, F.R.K. Chung, Pál Erdős, R.L. Graham, and J. Spencer. On graphs which contain all sparse graphs. Annals of Discrete Math., 12:21-26, 1982. In “Theory and Practice of Combinatorics” (A. Rosa, G. Sabidussi, J. Turgeon eds.).
[63]	László Babai and Pál Erdős. Representation of group elements as short products. Annals of Discrete Math., 12:27 - 30, 1982. In “Theory and Practice of Combinatorics” (A. Rosa, G. Sabidussi, J. Turgeon eds.).
[64]	László Babai, Dmitri Yu. Grigor'ev, and David M. Mount. Isomorphism of graphs with bounded eigenvalue multiplicity. In Proc. 14th ACM Symp. on Theory of Computing, San Francisco 1982, pages 310 - 324, 1982.
[65]	László Babai, Peter J. Cameron, and Péter P. Pálfy. On the orders of primitive groups with restricted nonabelian composition factors. J. Algebra, 79:161-168, 1982.
[66]	László Babai, Freud Róbert, and Kunfalvy Rezső. Prímszámvadászat számítógéppel (hunting for prime numbers with a computer). Természet Világa, 113(5):201 - 205, 1982. In Hungarian.
[67]	László Babai and Eugene M. Luks. Canonical labeling of graphs. In Proc. 15th ACM Symp. Thy. Computing, Boston, pages 171-183, 1983.
[68]	László Babai, William M. Kantor, and Eugene M. Luks. Computational complexity and the classification of finite simple groups. In Proc. 24th IEEE Symp. Found. Comp. Sci., Tucson AZ, pages 162-171, 1983.
[69]	László Babai. Permutation Groups, Coherent Configurations and Graph Isomorphism. PhD thesis, Hungarian Academy of Sciences, 1984. D.Sc. Thesis. In Hungarian.
[70]	László Babai and Endre Szemerédi. On the complexity of matrix group problems I. In Proc. 25th IEEE Symp. Found. Comp. Sci., Palm Beach, FL, pages 229 - 240, 1984.
[71]	László Babai. On Lovász' lattice reduction and the nearest lattice point problem. In Proc. 2nd Ann. Symp. on Theoretical Aspects of Comp. Sci. (STACS 85), Saarbrücken, volume 182 of Springer Lecture Notes in Comp. Sci., pages 13 - 20, 1985. See 1986.77.
[72]	László Babai. Trading group theory for randomness. In Proc. 17th ACM Symp. on Theory of Computing, Providence RI, pages 421-429, 1985.
[73]	László Babai. An anti-ramsey theorem. Graphs and Combinatorics, 1:23-28, 1985.
[74]	László Babai. Arc transitive covering digraphs and their eigenvalues. J. Graph Theory, 8:363-370, 1985.
[75]	László Babai and Vera T. Sós. Sidon sets in groups and induced subgraphs of Cayley graphs. Europ. J. Combinatorics, pages 101-114, 1985.
[76]	Miklós Ajtai, László Babai, Péter Hajnal, János Komlós, Pavel Pudlák, Vojtěch Rödl, Endre Szemerédi, and György Turán. Two lower bounds for branching programs. In Proc. 18th ACM Symp. on Theory of Computing, Berkeley CA, pages 30 - 38, 1986.
[77]	László Babai. On Lovász' lattice reduction and the nearest lattice point problem. Combinatorica, 6:1-14, 1986. Full version of 1985.71.
[78]	László Babai. A Las Vegas -NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues. In Proc. 27th IEEE Symp. on Foundations of Computer Science, Toronto, pages 303-312, 1986.
[79]	László Babai, Péter Frankl, and Janos Simon. Complexity classes in communication complexity theory. In Proc. 27th IEEE Symp. on Foundations of Computer Science, Toronto, pages 337 - 347, 1986.
[80]	László Babai. On the length of subgroup chains in the symmetric group. Communications in Algebra, 14:1729-1736, 1986.
[81]	Noga Alon, László Babai, and Alon Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. of Algorithms, 7:567-583, 1986.
[82]	László Babai. On the non-uniform Fisher inequality. Discrete Math., 66:303-307, 1987.
[83]	László Babai, Eugene M. Luks, and Ákos Seress. Permutation groups in NC. In Proc. 19th ACM STOC, New York, pages 409-420, 1987.
[84]	László Babai and Ákos Seress. On the degree of transitivity of permutation groups: a short proof. J. Combinatorial Theory-A, 45:310-315, 1987.
[85]	László Babai and György Turán. The complexity of defining a relation on a finite graph. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 33:277-288, 1987.
[86]	László Babai, Péter Hajnal, Endre Szemerédi, and György Turán. A lower bound for read-once-only branching programs. J. Computer and Sys. Sci., 35:153-162, 1987.
[87]	László Babai. Random oracles separate PSPACE from the polynomial-time hierarchy. Information Processing Letters, 26:51-53, 1987/88.
[88]	László Babai and Ákos Seress. On the diameter of Cayley graphs of the symmetric group. J. Combinatorial Theory-A, 49:175-179, 1988.
[89]	László Babai and Shlomo Moran. Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes. J. Computer and Sys. Sci., 36:254-276, 1988.
[90]	László Babai. On the non-uniform Ray-Chaudhuri-Wilson inequality. Combinatorica, 8:133-135, 1988.
[91]	László Babai, Eugene M. Luks, and Ákos Seress. Fast management of permutation groups. IEEE FOCS, 29:272-282, 1988.
[92]	László Babai, Bettina Just, and F. Meier auf der Heide. On the limits of computations with the floor function. Information and Computation, 78:99-107, 1988.
[93]	László Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and logspace-hard pseudorandom sequences. In Proc. 21st ACM STOC, Seattle WA, pages 1-11, 1989. See 1992.126.
[94]	László Babai. The probability of generating the symmetric group. J. Combinatorial Theory A, 52:148-153, 1989.
[95]	László Babai and Shlomo Moran. Proving properties of interactive proofs by a generalized counting technique. Information and Computation, 82:185-197, 1989.
[96]	László Babai and Lajos Rónyai. Computing irreducible representations of finite groups. In Proc. 30th IEEE FOCS, Research Triangle, NC, pages 93-98, 1989. See 1990.102.
[97]	László Babai, William M. Kantor, and Alex Lubotsky. Small diameter Cayley graphs for finite simple groups. European J. Comb., 10:507-522, 1989.
[98]	László Babai. E-mail and the unexpected power of interaction. In Proc. 5th IEEE Structure in Complexity Theory conf., Barcelona, pages 30-44, 1990. For Polish translation see item 1995.151.
[99]	László Babai, Lance Fortnow, and Carsten Lund. Nondeterministic exponential time has two-prover interactive protocols. In 31st IEEE FOCS, St. Louis MO, pages 16-25, 1990. See item 1991.108.
[100]	László Babai and Lance Fortnow. A characterization of #p by arithmetic straight line programs. In 31st IEEE FOCS, St. Louis MO, pages 26-34, 1990. See item 1991.109.
[101]	László Babai, Gábor Hetyei, William M. Kantor, Alex Lubotsky, and Ákos Seress. On the diameter of finite groups. In 31st IEEE FOCS, St. Louis MO, pages 857-865, 1990.
[102]	László Babai and Lajos Rónyai. Computing irreducible representations of finite groups. Mathematics of Computation, 55:705-722, 1990. Full version of item 1989.96.
[103]	László Babai, Pavel Pudlák, Vojtěch Rödl, and Endre Szemerédi. Lower bounds to the complexity of symmetric Boolean functions,. Theoretical Computer Science, 74:313-324, 1990.
[104]	László Babai, Miklós Simonovits, and Joel H. Spencer. Extremal subgraphs of random graphs. J. Graph Theory, 14:599-622, 1990.
[105]	László Babai, Lance Fortnow, Leonid A. Levin, and Mario Szegedy. Checking computations in polylogarithmic time. In Proc. 23rd ACM STOC, pages 21-31, 1991.
[106]	László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, and Ákos Seress. Fast Monte-Carlo algorithms for permutation groups. In Proc. 23rd ACM STOC, pages 90-100, 1991.
[107]	László Babai. Local expansion of vertex-transitive graphs and random generation in finite groups. In Proc. 23rd ACM STOC, pages 164-174, 1991.
[108]	László Babai, Lance Fortnow, and Carsten Lund. Nondeterministic exponential time has two-prover interactive protocols. Computational Complexity, 1:3-40, 1991. Full version of 1990.99.
[109]	László Babai and Lance Fortnow. Arithmetization: a new method in structural complexity theory. Computational Complexity, 1:41-67, 1991. Full version of item 1990.100.
[110]	László Babai, Albert J. Goodman, and László Lovász. Graphs with given automorphism group and few edge orbits. Europ. J. Comb., 12:185-203, 1991.
[111]	László Babai, Lance Fortnow, N. Nisan, and Avi Wigderson. BPP has subexponential simulations unless exptime has publishable proofs. In Proc. 6th Ann. Conf. on Structure in Complexity Theory, pages 213-219, Chicago, 1991. IEEE.
[112]	László Babai, Gene Cooperman, Larry Finkelstein, and Ákos Seress. Nearly linear time algorithms for permutation groups with a small base. In Proc. ISSAC'91 (Internat. Symp. on Symbolic and Algebraic Computation), pages 200-209, Bonn, 1991.
[113]	Noga Alon, László Babai, and Hiroshi Suzuki. Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type inequalities. J. Combinat. Theory-A, 58:165-180, 1991.
[114]	László Babai. Vertex-transitive graphs and vertex-transitive maps. J. Graph Theory, 15:587-627, 1991.
[115]	László Babai and K. Friedl. Approximate representation theory of finite groups. In 32nd IEEE FOCS, pages 733-742, Puerto Rico, 1991.
[116]	László Babai. Computational complexity in finite groups. In Proc. Internat. Congress of Mathematicians, Kyoto 1990, pages 1479-1489, Tokyo, 1991. Springer-Verlag.
[117]	László Babai. Deciding finiteness of matrix groups in Las Vegas polynomial time. In Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms, pages 33-40, Orlando, FL, 1992.
[118]	László Babai. Bounded round interactive proofs in finite groups. SIAM J. Discr. Math., 5:88-111, 1992.
[119]	László Babai, Robert Beals, and P. Takácsi-Nagy. Symmetry and complexity. In Proc. 24th ACM STOC, pages 438-449, Vancouver B.C., 1992.
[120]	László Babai and Mario Szegedy. Local expansion of symmetrical graphs. Combinatorics, Probability, and Computing, 1:1-11, 1992.
[121]	László Babai and Tamás Lengyel. A convergence criterion for recurrent sequences with application to the partition lattice. Analysis, 12:109-119, 1992.
[122]	László Babai. Transparent proofs. FOCUS (MAA Newsletter), 12(3):1-2, June 1992.
[123]	László Babai. Combinatorial optimization is hard. FOCUS (MAA Newsletter), 12(4):3,6,18, September 1992.
[124]	László Babai and Péter Frankl. Linear algebra methods in combinatorics with applications to geometry and computer science. Book, preliminary version 2, University of Chicago, 216 pages., 1992.
[125]	László Babai and Ákos Seress. On the diameter of permutation groups. Europ. J. Comb., 13:231-243, 1992.
[126]	László Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols, pseudorandom generators for Logspace, and time-space trade-offs. J. Comp. Sys. Sci., 45(2):204-232, 1992. Special issue. Full version of item 1989.93.
[127]	László Babai and Gábor L. Hetyei. On the diameter of random Cayley graphs of the symmetric group. Combinatorics, Probability, and Computing, 1:201-208, 1992.
[128]	László Babai and Vera T. Sós. Tibor gallai, 1912-1992. Combinatorica, 12:371-372, 1992.
[129]	László Babai. Transparent (holographic) proofs. In Proc. 10th Ann. Symp. on Theoret. Aspects of Comp. Sci. (STACS'93), volume 665 of Springer Lect. Notes in Comp. Sci., pages 525-534, Würzburg (Germany), 1993.
[130]	László Babai, Albert J. Goodman, and L. Pyber. On faithful permutation representations of small degree. Comm. Algebra, 21:1587-1602, 1993.
[131]	László Babai and Albert J. Goodman. Subdirectly reducible groups and edge-minimal graphs with given automorphism group. J. London Math. Soc., 47:417-432, 1993.
[132]	László Babai, Robert Beals, and Daniel Rockmore. Deciding finiteness of matrix groups in deterministic polynomial time. In Proc. ISSAC'93 (Internat. Symp. on Symbolic and Algebraic Computation), Kiev 1993, pages 117-126. ACM Press, 1993.
[133]	László Babai, Katalin Friedl, and Marcus Stricker. Decomposition of *-closed algebras in polynomial time. In Proc. ISSAC'93 (Internat. Symp. on Symbolic and Algebraic Computation), Kiev 1993, pages 86-94. ACM Press, 1993.
[134]	László Babai and Albert J. Goodman. On the abstract group of automorphisms. In D. Jungnickel and S. A. Vanstone, editors, “Coding Theory, Desing Theory, Group Theory”, Proc. of Marshall Hall Conf., Burlington VT 1990, pages 121-143. Wiley, 1993.
[135]	László Babai, Eugene M. Luks, and Ákos Seress. Computing composition series in primitive groups. In L. Finkelstein and W. M. Kantor, editors, Groups and Computation, volume 11 of DIMACS Ser. in Discr. Math. and Theor. Comp. Sci., pages 1-16. A.M.S., 1993. Workshop on groups and computation, Oct 7-10, 1991.
[136]	Sanjeev Arora, László Babai, Jacques Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. In Proc. 34th IEEE FOCS, pages 724-733, Palo Alto CA, 1993.
[137]	Robert Beals and László Babai. Las Vegas algorithms for matrix groups. In Proc. 34th IEEE FOCS, pages 427-436, Palo Alto CA, 1993.
[138]	László Babai, Lance Fortnow, N. Nisan, and Avi Wigderson. BPP has subexponential time simulations unless exptime has publishable proofs. Computational Complexity, 3:307-318, 1993. Full version of item 1991.111.
[139]	László Babai and László Pyber. Permutation groups without exponentially many orbits on the power set. J. Combinat. Theory, Ser. A, 66:160-168, 1994.
[140]	László Babai, Haluk Oral, and Kevin T. Phelps. Eulerian self-dual codes. SIAM J. Discr. Math., 7:325-330, 1994.
[141]	László Babai. Transparent proofs and limits to approximation. In Proc. First European Congress of Mathematics (1992), volume I, pages 31-91. Birkhäuser Verlag, 1994.
[142]	László Babai, Peter Kimmel, and Satyanarayana V. Lokam. Simultaneous messages vs communication. In E. Mayr and C. Puech, editors, 12th Ann. Symp. on Theoretical Aspects of Comp. Sci. (STACS'95), volume 900 of Lect. Notes in Comp. Sci., pages 361-372, Munich, 1995. Springer.
[143]	László Babai, Hunter Snevily, and Richard M. Wilson. A new proof of several inequalities on codes and sets. J. Combinat. Theory-A, 71:146-153, 1995.
[144]	László Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, and Ákos Seress. Fast Monte Carlo algorithms for permutation groups. J. Computer and System Sciences, 50:296-307, 1995. Special issue; full version of item 1991.106.
[145]	László Babai. Automorphism groups, isomorphism, reconstruction. In R. L. Graham, M. Grötschel, and László Lovász, editors, Handbook of Combinatorics, chapter 27, pages 1447-1540. North-Holland - Elsevier, 1995.
[146]	László Babai, Robert Beals, Jin yi Cai, Gábor Ivanyos, and Eugene M. Luks. Multiplicative equations over commuting matrices. In Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, pages 498-507, 1996.
[147]	László Babai, Anna Gál, János Kollár, Lajos Rónyai, Tibor Szabó, and Avi Wigderson. Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs. In Proc. 28th ACM STOC, pages 603-611, 1996.
[148]	László Babai. In and out of hungary: Paul Erdős, his friends, and times. In D. Miklós, V. T. Sós, and T. Szőnyi, editors, Combinatorics: Paul Erdős Is Eighty, volume 2, pages 7-95. J. Bolyai Mathematical Society, Budapest, 1996.
[149]	László Babai. We stare in disbelief ... (untitled letter on the death of Paul Erdős). Combinatorica, 16:452, 1996.
[150]	László Babai. Paul Erdős (1913-1996b). SIGACT News, 27(4):62-65, 1996.
[151]	László Babai. Poczta komputerowa i niezwykla moc interakcji. Wiadomości Matematyczne, XXXI:55-80, 1995. Polish translation of item 1990.98. Appeared Sep. 1996.
[152]	László Babai. The growth rate of vertex-transitive planar graphs. In Proc. 8th Ann. Symp. on Discrete Algorithms (SODA'97), pages 564-573, New Orleans LA, 1997. ACM-SIAM.
[153]	László Babai. Randomization in group algorithms: conceptual questions. In L. Finkelstein and W. M. Kantor, editors, “Groups and Computation II”, volume 28 of DIMACS Ser. in Discr. Math. and Theor. Comp. Sci., pages 1-16. A.M.S., 1997. Workshop on groups and computation, June 7-10, 1995.
[154]	László Babai. Paul Erdős and his influence on the theory of computing. SIAM News, 30(1):3, 1997.
[155]	László Babai. Paul Erdős (1913-1996): His influence on the theory of computing. In Proc. 29th ACM Symposium on Theory of Computing, pages 383-401, 1997.
[156]	László Babai and P. Kimmel. Randomized simultaneous messages: solution of a problem of Yao in communication complexity. In Proc. 12th IEEE Symp. on Computational Complexity, pages 239-246, 1997.
[157]	László Babai, Albert J. Goodman, William M. Kantor, Eugene M. Luks, and Péter P. Pálfy. Short presentations for finite groups. J. Algebra, 194:79-112, 1997.
[158]	László Babai, Albert J. Goodman, and László Pyber. Groups without faithful transitive permutation representations of small degree. J. Algebra, 195:1-29, 1997.
[159]	László Babai, Eugene M. Luks, and Ákos Seress. Fast management of permutation groups I. SIAM J. Comput., 26:1310-1342, 1997. Full version of 1988.91.
[160]	Sanjeev Arora, László Babai, Jacques Stern, and Z. Sweedyk. The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Sys. Sci., 54:317-331, 1997. Full version of 1993.136.
[161]	László Babai. Communication complexity. In I. Prívara and P. Ruži cka, editors, Math. Foundations of Comp. Sci. 1997, Proc. 22nd Internat. Symp, MFCS'97, volume 1295 of Lecture Notes in Computer Science, pages 5-18. Springer, 1997.
[162]	Péter Vértesi László Babai (organizer), Carl Pomerance. The mathematics of Paul Erdős. Notices of the A.M.S., 45(1):19-31, January 1998.
[163]	László Babai. Finite and transfinite combinatorics. In I. Prívara and P. Ruži cka, editors, Math. Foundations of Comp. Sci. 1997, Proc. 22nd Internat. Symp, MFCS'97, volume 1295 of Lecture Notes in Computer Science, pages 5-18. Springer, 1997. Part of item 161.
[164]	László Babai and Joel H. Spencer. Paul Erdős (1913-1996). Notices of the A.M.S., 45(1):64-73, January 1998.
[165]	László Babai. Paul Erdős just left town. In I. Prívara and P. Ruži cka, editors, Math. Foundations of Comp. Sci. 1997, Proc. 22nd Internat. Symp, MFCS'97, volume 1295 of Lecture Notes in Computer Science, pages 66-73. Springer, 1997. Part of item 1998.163.
[166]	László Babai. The forbidden sidetrip. In C. S. Calude, editor, People & Ideas in Theoretical Computer Science, pages 1-31. Springer, 1998.
[167]	László Babai, Thomas Hayes, and Peter Kimmel. The cost of the missing bit: Communication complexity with help. In 30th ACM STOC, pages 673-682, 1998.
[168]	László Babai. Magyarországon és a világban: Erdős Pál, barátai, és kora. Természet Világa, 129(3):31-36, 1998. Hungarian translation of parts of item 1996.148.
[169]	László Babai and Robert Beals. A polynomial-time theory of black box groups I. In C.M. Campbell, E.F. Robertson, N. Ruskuc, and G. C. Smith, editors, Groups St Andrews 1997 in Bath, I, London Math. Soc. Lect. Notes, pages 30-64. Cambr. U. Press, 1999.
[170]	László Babai, Anna Gál, and Avi Wigderson. Superpolynomial lower bounds for monotone span programs. Combinatorica, 19:301-320, 1999. Expanded version of part of item 2001.147.
[171]	László Babai and Sophie Laplante. Stronger separations for random-self-reducibility, rounds, and advice. In Proc. “Complexity '99” (14th Ann. IEEE Conf. on Computational Complexity, Atlanta 1999), pages 98-104. IEEE Comp. Soc., 1999.
[172]	László Babai and Igor Pak. Strong bias of group generators: an obstacle to the “product replacement algorithm.”. In Proc. 11th Ann. Symp. on Discrete Algorithms (SODA 2000), pages 627-635, San Francisco CA, 2000. ACM-SIAM.
[173]	László Babai and Peter J. Cameron. Automorphisms and enumeration of switching classes of tournaments. Electronic J. Comb., 7, 2000. #R38, 24 pp..
[174]	László Babai and Aner Shalev. Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups. In W. M. Kantor and Ákos Seress, editors, Groups and Computation III. Proc. 1999 Workshop at the Ohio State University, pages 39-62, Berlin-New York, 2001. Ohio State University Mathematical Research Institute Publications, deGruyter.
[175]	Lajos Rónyai, László Babai, and Murali K. Ganapathy. On the number of zero-patterns of a sequence of polynomials. J. Amer. Math. Soc., 14:717-735, 2001.
[176]	László Babai, Péter Frankl, Samuel Kutin, and Daniel Štefankovič. Set systems with restricted intersections modulo prime powers. J. Combinatorial Theory - A, 95:39-73, 2001.
[177]	László Babai, Thomas Hayes, and Peter Kimmel. The cost of the missing bit: Communication complexity with help. Combinatorica, 21:455-488, 2001. Expanded version of item 1998.167.
[178]	László Babai, William M. Kantor, Péter P. Pálfy, and Ákos Seress. Black-box recognition of finite simple groups of Lie type by statistics of element orders. J. Group Theory, 5:383 - 401, 2002.
[179]	László Babai, Amir Shpilka, and Daniel Stefankovič. Locally testable cyclic codes. In Proc. 44th IEEE FOCS, pages 116-125, 2003. Submitted to IEEE Trans. on Information Theory.
[180]	László Babai, Robert Beals, and Ákos Seress. On the diameter of the symmetric group: polynomial bounds. In Proc. 15th Ann. Symp. on Discrete Algorithms (SODA'04), pages 1101-1105. ACM-IEEE, 2004.
[181]	László Babai and Igor Pak. Strong bias of group generators: An obstacle to the “product replacement algorithm”. J. Algorithms, 50:215-231, 2004. Journal version of item 2000.172.
[182]	László Babai and Daniel Štefankovi c. Simultaneous Diophantine approximation with excluded primes. In Proc. 15th Ann. Symp. on Discrete Algorithms (SODA'04), pages 1116-1122. ACM-IEEE, 2004.
[183]	László Babai, Anna Gál, Peter Kimmel, and Satyanarayana V. Lokam. Communication complexity of simultaneous messages. SIAM J. Comp., 33:137 - 166, 2004. Greatly expanded version of 1995.142. Electronic edition: http://epubs.siam.org/sam-bin/dbq/article/37594.
[184]	László Babai and Thomas Hayes. Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group. In Proc. 16th Ann. Symp. on Discrete Algorithms (SODA'05). ACM-IEEE, 2005.
[185]	László Babai, Amir Shpilka, and Daniel Stefankovič. Locally testable cyclic codes. IEEE Trans. on Information Theory, 2005. Journal version of 2003.179.
[186]	László Babai. On the diameter of Eulerian orientations of graphs. In Proc. 17th Ann. Symp. on Discrete Algorithms (SODA'06), pages 822-831. ACM-SIAM, 2006.
[187]	László Babai. Guest editor's foreword to the special issue dedicated to the 40th acm symposium on theory of computing. SIAM Journal of Computer Science, 35(4):ix-x, 2006.
[188]	László Babai and Thomas Hayes. The probability of generating the symmetric group when one of the generators is random. Publ. Math. Debrecen, 69(3):271-280, 2006.
[189]	László Babai and Igor Gorodezky. Sandpile transience on the grid is polynomially bounded. In Proc. 18th Ann. Symp. on Discrete Algorithms (SODA'07), pages 627-636. ACM-SIAM, 2007.
[190]	Miklós Abért and László Babai. Finite groups of uniform logarithmic diameter. Israel J. Math, 158, 193-203.
[191]	László Babai, Nikolai Nikolov, and László Pyber. Product growth and mixing in finite groups. In Proc. 19th Ann. Symp. on Discrete Algorithms (SODA'08), pages 248-257. ACM-SIAM, 2008. Full paper in preparation.
[192]	László Babai and Paolo Codenotti. Isomorphism of hypergraphs of low rank in moderately exponential time. In Proc. 39th Ann. IEEE Symp. on Theory of Computing (FOCS'08), pages 667-676. IEEE Comp. Soc. Press, 2008. NSF Grant #CCF-0830370.
[193]	László Babai, Péter P. Pálfy, and Jan Saxl. On the number of p-regular elements in finite simple groups. LMS Journal of Computation and Mathematics, 12:82-119, 2009. NSF Grants #CCR-9732205 and #CCF-0830370.
[194]	László Babai, Robert Beals, and Ákos Seress. Polynomial-time theory of matrix groups. In Proc. 41st ACM STOC, pages 55-64, 2009. NSF Grant #CCF-0830370.
[195]	László Babai and Barry Guiduli. Spectral extrema for graphs: the Zarankiewicz problem. Electronic J. of Combinatorics, 16(1):R123 (8pp), September 2009.
[196]	László Babai and Pedro Felzenszwalb. Computing rank-convolutions with a mask. ACM Transactions on Algorithms, 6(1):20:1-20:13, 2009.
[197]	László Babai, Anandam Banerjee, Raghav Kulkarni, and Vipul Naik. Evasiveness and the distribution of prime numbers. In Proc. 27th Ann. Symp. on Theoretical Aspects of Comp. Sci. (STACS 2010), pages 71-82. Schloss Dagstuhl Online Publ., 2010. NSF Grant #CCF-0830370.
[198]	László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, and Xiaoming Sun. Weights of exact threshold functions. In Proc. 35th Internat. Symp. on Mathematical Foundations of Computer Science (MFCS'10) LNCS, pages 66-77. Springer, 2010.
[199]	László Babai, Paolo Codenotti, Joshua Grochow, and Youming Qiao. Code equivalence and group isomorphism. In Proc. 22nd Ann. Symp. on Discrete Algorithms (SODA'11), pages 1395-1408. ACM-SIAM, 2011. NSF Grant #CCF-0830370.