Skip to content

Lszl Babai

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

57

Venues

9

Active years

1979–2019

Best venue rank

A*

Where they publish

Papers

57 indexed papers, newest first.

YearVenueTitleAuthors
2019STOCCanonical form for graphs in quasipolynomial time: preliminary report.Lszl Babai
2016STOCGraph isomorphism in quasipolynomial time [extended abstract].Lszl Babai
2013FOCSFaster Canonical Forms for Strongly Regular Graphs.Lszl Babai, Xi Chen, Xiaorui Sun, Shang-Hua Teng, John Wilmes
2013STOCQuasipolynomial-time canonical form for steiner designs.Lszl Babai, John Wilmes
2012ICALPPolynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract).Lszl Babai, Paolo Codenotti, Youming Qiao
2012STACSPolynomial-time Isomorphism Test for Groups with Abelian Sylow Towers.Lszl Babai, Youming Qiao
2011CSRFinite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas.Lszl Babai
2011SODACode Equivalence and Group Isomorphism.Lszl Babai, Paolo Codenotti, Joshua A. Grochow, Youming Qiao
2010MFCSWeights of Exact Threshold Functions.Lszl Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun
2010STACSEvasiveness and the Distribution of Prime Numbers.Lszl Babai, Anandam Banerjee, Raghav Kulkarni, Vipul Naik
2009STOCPolynomial-time theory of matrix groups.Lszl Babai, Robert Beals, kos Seress
2008FOCSIsomorhism of Hypergraphs of Low Rank in Moderately Exponential Time.Lszl Babai, Paolo Codenotti
2008SODAProduct growth and mixing in finite groups.Lszl Babai, Nikolay Nikolov, Lszl Pyber
2007SODASandpile transience on the grid is polynomially bounded.Lszl Babai, Igor Gorodezky
2006SODAOn the diameter of Eulerian orientations of graphs.Lszl Babai
2005SODANear-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group.Lszl Babai, Thomas P. Hayes
2004SODAOn the diameter of the symmetric group: polynomial bounds.Lszl Babai, Robert Beals, kos Seress
2004SODASimultaneous diophantine approximation with excluded primes.Lszl Babai, Daniel Stefankovic
2003FOCSLocally Testable Cyclic Codes.Lszl Babai, Amir Shpilka, Daniel Stefankovic
2000SODAStrong bias of group generators: an obstacle to the "product replacement algorithm".Lszl Babai, Igor Pak
1998STOCThe Cost of the Missing Bit: Communication Complexity with Help.Lszl Babai, Thomas P. Hayes, Peter G. Kimmel
1997MFCSCommunication Complexity.Lszl Babai
1997SODAThe Growth Rate of Vertex-Transitive Planar Graphs.Lszl Babai
1997STOCPaul Erds (1913-1996): His Influence on the Theory of Computing.Lszl Babai
1996SODAMultiplicative Equations over Commuting Matrices.Lszl Babai, Robert Beals, Jin-yi Cai, Gbor Ivanyos, Eugene M. Luks
1996STOCExtremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs.Lszl Babai, Anna Gl, Jnos Kollr, Lajos Rnyai, Tibor Szab, Avi Wigderson
1995STACSSimultaneous Messages vs. Communication.Lszl Babai, Peter G. Kimmel, Satyanarayana V. Lokam
1993FOCSThe Hardness of Approximate Optimia in Lattices, Codes, and Systems of Linear EquationsSanjeev Arora, Lszl Babai, Jacques Stern, Z. Sweedyk
1993FOCSLas Vegas algorithms for matrix groupsRobert Beals, Lszl Babai
1993ISSACDeciding Finiteness of Matrix Groups in Deterministic Polynomial Time.Lszl Babai, Robert Beals, Daniel N. Rockmore
1993ISSACDecomposition of *-closed Algebras in Polynomial Time.Lszl Babai, Katalin Friedl, Markus Stricker
1993STACSTransparent (Holographic) Proofs.Lszl Babai
1992SODADeciding Finiteness of Matrix Groups in Las Vegas Polynomial Time.Lszl Babai
1992STOCSymmetry and ComplexityLszl Babai, Robert Beals, Pl Takcsi-Nagy
1991FOCSApproximate Representation Theory of Finite GroupsLszl Babai, Katalin Friedl
1991ISSACNearly Linear Time Algorithms for Permutation Groups with a Small Base.Lszl Babai, Gene Cooperman, Larry Finkelstein, kos Seress
1991STOCLocal Expansion of Vertex-Transitive Graphs and Random Generation in Finite GroupsLszl Babai
1991STOCFast Monte Carlo Algorithms for Permutation GroupsLszl Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, kos Seress
1991STOCChecking Computations in Polylogarithmic TimeLszl Babai, Lance Fortnow, Leonid A. Levin, Mario Szegedy
1990FOCSA Characterization of \sharp P Arithmetic Straight Line ProgramsLszl Babai, Lance Fortnow
1990FOCSNon-Deterministic Exponential Time Has Two-Prover Interactive ProtocolsLszl Babai, Lance Fortnow, Carsten Lund
1990FOCSOn the Diameter of Finite GroupsLszl Babai, Gbor Hetyei, William M. Kantor, Alexander Lubotzky, kos Seress
1989FOCSComputing Irreducible Representations of Finite GroupsLszl Babai, Lajos Rnyai
1989STOCMultiparty Protocols and Logspace-hard Pseudorandom Sequences (Extended Abstract)Lszl Babai, Noam Nisan, Mario Szegedy
1988FOCSFast Management of Permutation GroupsLszl Babai, Eugene M. Luks, kos Seress
1987STOCPermutation Groups in NCLszl Babai, Eugene M. Luks, kos Seress
1986FOCSA Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvaluesLszl Babai
1986FOCSComplexity classes in communication complexity theory (preliminary version)Lszl Babai, Peter Frankl, Janos Simon
1986STOCTwo lower bounds for branching programsMikls Ajtai, Lszl Babai, Pter Hajnal, Jnos Komls, Pavel Pudlk, Vojtech Rdl, Endre Szemerdi, Gyrgy Turn
1985STOCTrading Group Theory for RandomnessLszl Babai
1985STACSOn Lovsz' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version).Lszl Babai
1984FOCSOn the Complexity of Matrix Group Problems ILszl Babai, Endre Szemerdi
1983FOCSComputational Complexity and the Classification of Finite Simple GroupsLszl Babai, William M. Kantor, Eugene M. Luks
1983STOCCanonical Labeling of GraphsLszl Babai, Eugene M. Luks
1982STOCIsomorphism of Graphs with Bounded Eigenvalue MultiplicityLszl Babai, D. Yu. Grigoryev, David M. Mount
1981FCTModerately Exponential Bound for Graph Isomorphism.Lszl Babai
1979FOCSCanonical Labelling of Graphs in Linear Average TimeLszl Babai, Ludek Kucera