László Babai
Orcid: 000000022058685XAffiliations:
 University of Chicago, Departments of Computer Science and Mathematics
According to our database^{1},
László Babai
authored at least 127 papers
between 1972 and 2021.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:

on zbmath.org

on viaf.org

on orcid.org

on dnb.info

on isni.org

on dl.acm.org
On csauthors.net:
Bibliography
2021
Proceedings of the 36th Computational Complexity Conference, 2021
2019
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019
2018
Proceedings of the Approximation, 2018
2016
Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, 2016
2015
Dagstuhl Reports, 2015
CoRR, 2015
CoRR, 2015
2014
Proceedings of the Innovations in Theoretical Computer Science, 2014
2013
J. Lond. Math. Soc., 2013
Proceedings of the Symposium on Theory of Computing Conference, 2013
Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science, 2013
2012
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012
PolynomialTime Isomorphism Test for Groups with No Abelian Normal Subgroups  (Extended Abstract).
Proceedings of the Automata, Languages, and Programming  39th International Colloquium, 2012
2011
Proceedings of the TwentySecond Annual ACMSIAM Symposium on Discrete Algorithms, 2011
Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas.
Proceedings of the Computer Science  Theory and Applications, 2011
2010
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
2009
ACM Trans. Algorithms, 2009
LMS J. Comput. Math., 2009
Electron. J. Comb., 2009
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009
2008
Electron. Colloquium Comput. Complex., 2008
Proceedings of the Nineteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2008
Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science, 2008
2007
Proceedings of the Eighteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2007
2006
Special Issue Dedicated To The ThirtySixth Annual ACM Symposium On Theory Of Computing (STOC 2004).
SIAM J. Comput., 2006
Discret. Math., 2006
Proceedings of the Seventeenth Annual ACMSIAM Symposium on Discrete Algorithms, 2006
2005
IEEE Trans. Inf. Theory, 2005
Nearindependence of permutations and an almost sure polynomial bound on the diameter of the symmetric group.
Proceedings of the Sixteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2005
2004
Strong bias of group generators: an obstacle to the "product replacement algorithm".
J. Algorithms, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
Proceedings of the Fifteenth Annual ACMSIAM Symposium on Discrete Algorithms, 2004
2003
SIAM J. Comput., 2003
2001
J. Comb. Theory A, 2001
Comb., 2001
2000
Electron. J. Comb., 2000
1999
Comb., 1999
Proceedings of the 14th Annual IEEE Conference on Computational Complexity, 1999
1997
SIAM J. Comput., 1997
The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations.
J. Comput. Syst. Sci., 1997
Proceedings of the TwentyNinth Annual ACM Symposium on the Theory of Computing, 1997
Proceedings of the Eighth Annual ACMSIAM Symposium on Discrete Algorithms, 1997
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
Randomized Simultaneous Messages: Solution of a Problem of Yao in Communication Complexity.
Proceedings of the Twelfth Annual IEEE Conference on Computational Complexity, 1997
1996
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.
Proceedings of the TwentyEighth Annual ACM Symposium on the Theory of Computing, 1996
Proceedings of the Seventh Annual ACMSIAM Symposium on Discrete Algorithms, 1996
1995
A New Proof of Several Inequalities on Codes and Sets.
J. Comb. Theory A, 1995
J. Comput. Syst. Sci., 1995
Proceedings of the STACS 95, 1995
Proceedings of the Groups and Computation, 1995
1994
SIAM J. Discret. Math., 1994
Permutation Groups without Exponentially Many Orbits on the Power Set.
J. Comb. Theory A, 1994
1993
Comput. Complex., 1993
Proceedings of the STACS 93, 1993
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
The Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear Equations
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993
1992
SIAM J. Discret. Math., 1992
Multiparty Protocols, Pseudorandom Generators for Logspace, and TimeSpace TradeOffs.
J. Comput. Syst. Sci., 1992
Eur. J. Comb., 1992
Comb. Probab. Comput., 1992
Comb. Probab. Comput., 1992
Addendum to NonDeterministic Exponential Time has TwoProver Interactive Protocols.
Comput. Complex., 1992
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992
Proceedings of the Third Annual ACM/SIGACTSIAM Symposium on Discrete Algorithms, 1992
1991
J. Graph Theory, 1991
Multilinear polynomials and FranklRayChaudhuriWilson type intersection theorems.
J. Comb. Theory A, 1991
Eur. J. Comb., 1991
Comput. Complex., 1991
Comput. Complex., 1991
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Local Expansion of VertexTransitive Graphs and Random Generation in Finite Groups
Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991
Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991
Proceedings of the Groups And Computation, 1991
Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, June 30, 1991
1990
Theor. Comput. Sci., 1990
J. Graph Theory, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990
1989
Inf. Comput., August, 1989
J. Comb. Theory A, 1989
Eur. J. Comb., 1989
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
1988
Inf. Comput., August, 1988
J. Comb. Theory A, 1988
ArthurMerlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes.
J. Comput. Syst. Sci., 1988
Comb., 1988
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988
1987
Math. Log. Q., 1987
J. Comb. Theory A, 1987
J. Comput. Syst. Sci., 1987
Inf. Process. Lett., 1987
Discret. Math., 1987
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987
1986
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem.
J. Algorithms, 1986
Comb., 1986
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
A Las VegasNC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986
1985
J. Graph Theory, 1985
Graphs Comb., 1985
Eur. J. Comb., 1985
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985
On Lovász' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version).
Proceedings of the STACS 85, 1985
1984
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984
1983
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983
Proceedings of the 24th Annual Symposium on Foundations of Computer Science, 1983
1982
Eur. J. Comb., 1982
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982
1981
Proceedings of the Fundamentals of Computation Theory, 1981
1980
SIAM J. Comput., 1980
SIAM J. Comput., 1980
J. Comb. Theory B, 1980
J. Comb. Theory A, 1980
1979
J. Graph Theory, 1979
J. Comb. Theory B, 1979
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979
1978
J. Comb. Theory B, 1978
Discret. Math., 1978
1977
J. Graph Theory, 1977
1973
Discret. Math., 1973
1972
Discret. Math., 1972