László Babai

László Babai, Sophie Laplante, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

László Babai, L. Babai, 2004, STOC 2004.

On the diameter of permutation groups

László Babai, Ákos Seress, L. Babai, 1992, Eur. J. Comb..

Checking computations in polylogarithmic time

Leonid A. Levin, Lance Fortnow, László Babai, 1991, STOC '91.

Permutation groups in NC

László Babai, Ákos Seress, Eugene M. Luks, 1987, STOC '87.

Moderately Exponential Bound for Graph Isomorphism

László Babai, L. Babai, 1981, FCT.

Graphs with Given Automorphism Group and Few Edge Orbits

László Lovász, László Babai, Albert J. Goodman, 1991, Eur. J. Comb..

Strong bias of group generators: an obstacle to the “product replacement algorithm”

László Babai, Igor Pak, L. Babai, 2000, SODA '00.

Spectral Extrema for Graphs: The Zarankiewicz Problem

László Babai, Barry Guiduli, L. Babai, 2009, Electron. J. Comb..

Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs

Lajos Rónyai, Avi Wigderson, László Babai, 1996, STOC '96.

Decomposition of *-closed algebras in polynomial time

László Babai, Katalin Friedl, Markus Stricker, 1993, ISSAC '93.

Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group

Thomas P. Hayes, László Babai, 2005, SODA '05.

Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time

László Babai, Paolo Codenotti, L. Babai, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

On the Complexity of Canonical Labeling of Strongly Regular Graphs

László Babai, L. Babai, 1980, SIAM J. Comput..

Random Graph Isomorphism

Paul Erdös, László Babai, Stanley M. Selkow, 1980, SIAM J. Comput..

On the diameter of the symmetric group: polynomial bounds

László Babai, Ákos Seress, Robert Beals, 2004, SODA '04.

Isomorphism of graphs with bounded eigenvalue multiplicity

David M. Mount, László Babai, D. Yu. Grigoryev, 1982, STOC '82.

Random Oracles Separate PSPACE from the Polynomial-Time Hierarchy

László Babai, L. Babai, 1987, Inf. Process. Lett..

Simultaneous diophantine approximation with excluded primes

László Babai, Daniel Stefankovic, L. Babai, 2004, SODA '04.

Communication Complexity of Simultaneous Messages

Satyanarayana V. Lokam, László Babai, Anna Gál, 2003, SIAM J. Comput..

BPP has subexponential time simulations unlessEXPTIME has publishable proofs

Lance Fortnow, Noam Nisan, Avi Wigderson, 2005, computational complexity.

On Set Intersections

Peter Frankl, László Babai, 1980, J. Comb. Theory, Ser. A.

Proving Properties of Interactive Proofs by a Generalized Counting Technique

László Babai, Shlomo Moran, 1989, Inf. Comput..

On Lovász’ lattice reduction and the nearest lattice point problem

László Babai, L. Babai, 1986, Comb..

Communication Complexity

László Babai, 1997, MFCS.

Arc transitive covering digraphs and their eigenvalues

László Babai, 1985, J. Graph Theory.

Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs

Noam Nisan, László Babai, Mario Szegedy, 1992, J. Comput. Syst. Sci..

Two lower bounds for branching programs

Vojtech Rödl, János Komlós, Endre Szemerédi, 1986, STOC '86.

The growth rate of vertex-transitive planar graphs

László Babai, L. Babai, 1997, SODA '97.

The Cost of the Missing Bit: Communication Complexity with Help

Thomas P. Hayes, László Babai, Peter G. Kimmel, 1998, STOC '98.

Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes

László Babai, Shlomo Moran, S. Moran, 1988, J. Comput. Syst. Sci..

Complexity classes in communication complexity theory (preliminary version)

Peter Frankl, László Babai, Janos Simon, 1986, IEEE Annual Symposium on Foundations of Computer Science.

Computational complexity and the classification of finite simple groups

László Babai, William M. Kantor, Eugene M. Luks, 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

Product growth and mixing in finite groups

László Babai, László Pyber, Nikolay Nikolov, 2008, SODA '08.

Deciding finiteness of matrix groups in Las Vegas polynomial time

László Babai, 1992, SODA '92.

A Las Vegas - NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues

László Babai, L. Babai, 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

Multiplicative equations over commuting matrices

Jin-Yi Cai, László Babai, Gábor Ivanyos, 1996, SODA '96.

On the degree of transitivity of permutation groups: A short proof

László Babai, Ákos Seress, L. Babai, 1987, J. Comb. Theory, Ser. A.

E-mail and the unexpected power of interaction

László Babai, L. Babai, 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.

Polynomial-time theory of matrix groups

László Babai, Ákos Seress, Robert Beals, 2009, STOC '09.

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem

Noga Alon, Alon Itai, László Babai, 1985, J. Algorithms.

Multiparty protocols and logspace-hard pseudorandom sequences

Noam Nisan, László Babai, Mario Szegedy, 1989, STOC '89.

Non-deterministic exponential time has two-prover interactive protocols

Carsten Lund, Lance Fortnow, László Babai, 1992, computational complexity.

Graph isomorphism in quasipolynomial time [extended abstract]

László Babai, L. Babai, 2016, STOC.

The probability of generating the symmetric group

László Babai, L. Babai, 1989, J. Comb. Theory, Ser. A.

The Cost of the Missing Bit: Communication Complexity with Help

Thomas P. Hayes, László Babai, Peter G. Kimmel, 2001, Comb..

Superpolynomial Lower Bounds for Monotone Span Programs

Avi Wigderson, László Babai, Anna Gál, 1996, Comb..

Fast Management of Permutation Groups I

László Babai, Ákos Seress, Eugene M. Luks, 1997, SIAM J. Comput..

Property Testing of Equivalence under a Permutation Group Action

László Babai, Sourav Chakraborty, 2008, Electron. Colloquium Comput. Complex..

Bounds on the diameter of Cayley graphs of the symmetric group

László Babai, Ákos Seress, L. Babai, 1988, Journal of Algebraic Combinatorics.

Permutation Groups without Exponentially Many Orbits on the Power Set

László Babai, László Pyber, 1994, J. Comb. Theory, Ser. A.

Transparent Proofs and Limits to Approximation

László Babai, László Babai, L. Babai, 1994 .

Weights of exact threshold functions

Kristoffer Arnsfelt Hansen, László Babai, Xiaoming Sun, 2010, MFCS.

Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs

László Babai, Vera T. Sós, V. Sós, 1985, Eur. J. Comb..

On the Automorphism Groups of almost all Cayley Graphs

Chris D. Godsil, László Babai, L. Babai, 1982, Eur. J. Comb..

On the Limits of Computations with the Floor Function

Friedhelm Meyer auf der Heide, László Babai, Bettina Just, 1988, Inf. Comput..

Computing rank-convolutions with a mask

László Babai, Pedro F. Felzenszwalb, L. Babai, 2009, TALG.

Randomized simultaneous messages: solution of a problem of Yao in communication complexity

László Babai, Peter G. Kimmel, L. Babai, 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

Fast management of permutation groups

László Babai, Ákos Seress, Eugene M. Luks, 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

Sandpile transience on the grid is polynomially bounded

László Babai, Igor Gorodezky, 2007, SODA '07.

Locally testable cyclic codes

László Babai, Daniel Stefankovic, Amir Shpilka, 2005, IEEE Transactions on Information Theory.

Automorphism groups of graphs and edge-contraction

László Babai, L. Babai, 1974, Discret. Math..

The Complexity of Defining a Relation on a Finite Graph

László Babai, György Turán, L. Babai, 1987, Math. Log. Q..

Locally testable cyclic codes

László Babai, Daniel Stefankovic, Amir Shpilka, 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract)

László Babai, Youming Qiao, Paolo Codenotti, 2012, ICALP.

Non-deterministic exponential time has two-prover interactive protocols

Carsten Lund, Lance Fortnow, László Babai, 2005, computational complexity.

A characterization of Hash P by arithmetic straight line programs

Lance Fortnow, László Babai, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas

László Babai, L. Babai, 2011, CSR.

Deciding finiteness of matrix groups in deterministic polynomial time

László Babai, Daniel N. Rockmore, Robert Beals, 1993, ISSAC '93.

Set Systems with Restricted Intersections modulo Prime Powers

Peter Frankl, László Babai, Daniel Stefankovic, 2001, J. Comb. Theory, Ser. A.

Spectra of Cayley graphs

László Babai, L. Babai, 1979, J. Comb. Theory B.

A Lower Bound for Read-Once-Only Branching Programs

Endre Szemerédi, László Babai, György Turán, 1987, J. Comput. Syst. Sci..

Nondeterministic exponential time has two-prover interactive protocols

Carsten Lund, Lance Fortnow, László Babai, 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

Fast Monte Carlo algorithms for permutation groups

László Babai, Gene Cooperman, Ákos Seress, 1991, STOC '91.

Randomization in group algorithms: Conceptual questions

László Babai, L. Babai, 1995, Groups and Computation.

List-decoding homomorphism codes with arbitrary codomains

László Babai, Angela Wuu, Timothy J. F. Black, 2018, APPROX-RANDOM.

Complexity classes in communication complexity theory

Peter Frankl, László Babai, Janos Simon, 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

Paul Erdös (1913-996): his influence on the theory of computing

László Babai, L. Babai, 1997, STOC '97.

Automorphisms and Enumeration of Switching Classes of Tournaments

Peter J. Cameron, László Babai, L. Babai, 2000, Electron. J. Comb..

Graph isomorphism in quasipolynomial time [extended abstract] pdf

László Babai, L. Babai, 2015, STOC.

Code equivalence and group isomorphism

Joshua A. Grochow, László Babai, Youming Qiao, 2011, SODA '11.

On the Nonuniform Fisher Inequality

László Babai, L. Babai, 1987, Discret. Math..

Nearly linear time algorithms for permutation groups with a small base

László Babai, Gene Cooperman, Ákos Seress, 1991, ISSAC '91.

On groups of polyhedral graphs

László Babai, Wilfried Imrich, L. Babai, 1973, Discret. Math..

Algebraic methods in computational complexity: arithmetic circuits, communication complexity, and interactive proof systems

Satyanarayana V. Lokam, László Babai, 1996 .

Las Vegas algorithms for matrix groups

László Babai, Robert Beals, L. Babai, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems

Noga Alon, László Babai, H. Suzuki, 1991, J. Comb. Theory, Ser. A.

Automorphism groups of graphs and edge-contraction

László Babai, 1974, Discret. Math..

On the diameter of Eulerian orientations of graphs

László Babai, L. Babai, 2006, SODA '06.

A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality

László Babai, L. Babai, 1988, Comb..

Lower Bounds to the Complexity of Symmetric Boolean Functions

Vojtech Rödl, Endre Szemerédi, Pavel Pudlák, 1990, Theor. Comput. Sci..

The Mathematics of Paul Erdős I

László Babai, Carl Pomerance, L. Babai, 2013 .

Evasiveness and the Distribution of Prime Numbers pdf

Raghav Kulkarni, László Babai, Vipul Naik, 2010, STACS.

Quasipolynomial-time canonical form for steiner designs

László Babai, John Wilmes, John Wilmes, 2013, STOC '13.

Vector representable matroids of given rank with given automorphism group

László Babai, L. Babai, 1978, Discret. Math..

Some applications of graph contractions

László Babai, 1977, J. Graph Theory.

Infinite digraphs with given regular automorphism groups

László Babai, L. Babai, 1978, J. Comb. Theory, Ser. B.

Proportions of r-regular elements in finite classical groups

Cheryl E. Praeger, László Babai, Robert A. Wilson, 2013, J. Lond. Math. Soc..

The hardness of approximate optima in lattices, codes, and systems of linear equations

Jacques Stern, Sanjeev Arora, László Babai, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

On the automorphism groups of strongly regular graphs II

László Babai, L. Babai, 2015 .

Local Expansion of Ssymmetrical Graphs

László Babai, Mario Szegedy, 1992, Comb. Probab. Comput..

Trading group theory for randomness

László Babai, L. Babai, 1985, STOC '85.

The Graph Isomorphism Problem (Dagstuhl Seminar 15511)

Jacobo Torán, László Babai, Anuj Dawar, 2015, Dagstuhl Reports.

GROUP, GRAPHS, ALGORITHMS: THE GRAPH ISOMORPHISM PROBLEM

László Babai, L. Babai, 2019, Proceedings of the International Congress of Mathematicians (ICM 2018).

Transparent (Holographic) Proofs

László Babai, L. Babai, 1993, STACS.

Computing irreducible representations of finite groups

Lajos Rónyai, László Babai, L. Babai, 1989, 30th Annual Symposium on Foundations of Computer Science.

Special Issue Dedicated To The Thirty-Sixth Annual ACM Symposium On Theory Of Computing (STOC 2004)

László Babai, 2006, SIAM J. Comput..

Canonical form for graphs in quasipolynomial time: preliminary report

László Babai, L. Babai, 2019, STOC.

Eulerian Self-Dual Codes

Kevin T. Phelps, László Babai, Haluk Oral, 1994, SIAM J. Discret. Math..

Matrix rigidity depends on the target field

László Babai, Bohdan Kivva, L. Babai, 2021, CCC.

Symmetry groups of vertex-transitive polytopes

László Babai, L. Babai, 1977 .

Black-box recognition of finite simple groups of Lie type by statistics of element orders

László Babai, William M. Kantor, Ákos Seress, 2002 .

Dimension and automorphism groups of lattices

László Babai, Dwight Duffus, L. Babai, 1981 .

On the Minimum Order of Graphs with Given Group

László Babai, L. Babai, 1974, Canadian Mathematical Bulletin.

Coset Intersection in Moderately Exponential Time

László Babai, 2013 .

Entropy Versus Pairwise Independence

László Babai, 2013 .

On the order of doubly transitive permutation groups

László Babai, L. Babai, 1982 .

On the orders of primitive groups with restricted nonabelian composition factors

Peter J. Cameron, László Babai, Péter P. Pálfy, 1982 .

On a conjecture of M. E. Watkins on graphical regular representations of finite groups

László Babai, L. Babai, 1978 .

Groups of graphs on given surfaces

László Babai, L. Babai, 1973 .

Sense preserving groups of polyhedral graphs

László Babai, W. Imrich, 1975 .

Computing irreducible representations of finite groups

Lajos Rónyai, László Babai, L. Babai, 1990 .

On the length of subgroup chains in the symmetric group

László Babai, 1986 .

Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups

László Babai, Aner Shalev, 2008 .

Isomorphism problem for a class of point-symmetric structures

László Babai, L. Babai, 1977 .

Finite digraphs with given regular automorphism groups

László Babai, L. Babai, 1980 .

Testing isomorphism of combinatorial and algebraic structures

László Babai, Paolo Codenotti, 2011 .

Chromatic number and subgraphs of cayley graphs

László Babai, L. Babai, 1978 .

Isomorphisms of Cayley graphs. II

Peter Frankl, László Babai, P. Frankl, 1979 .

Asymmetric trees with two prescribed degrees

László Babai, L. Babai, 1977 .

Almost All Steiner Triple Systems Are Asymmetric

László Babai, 1980 .

On the Number of p -Regular Elements in Finite Simple Groups

László Babai, Péter P. Pálfy, Jan Saxl, 2009 .

On the automorphism groups of strongly regular graphs II

László Babai, 2015 .

Connectivity of infinite graphs having a transitive torsion group action

László Babai, L. Babai, M. Watkins, 1980 .

Isomorphism testing and symmetric of graphs

László Babai, 1980 .

A Structure Theory of the Sandpile Monoid for Directed Graphs

László Babai, Evelin Toumpakari, 2010 .

A remark on contraction of graphs with given group

László Babai, L. Babai, 1974 .

Fixing the UPCC case of Split-or-Johnson

László Babai, 2017 .

High Chromatic Rigid Graphs II

László Babai, Jaroslav Nešetřil, 1982 .

Computational Complexity in Finite Groups

László Babai, L. Babai, 1991 .

Short Presentations for Finite Groups

László Babai, William M. Kantor, Eugene M. Luks, 1992 .