BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Canada
1 × United Kingdom
12 × USA
Collaborated with:
E.M.Luks Á.Seress R.Beals M.Szegedy J.Wilmes P.Codenotti Y.Qiao T.P.Hayes P.G.Kimmel P.Takácsi-Nagy N.Nisan D.Y.Grigoryev D.M.Mount L.Fortnow L.A.Levin G.Cooperman L.Finkelstein A.Gál J.Kollár L.Rónyai T.Szabó A.Wigderson M.Ajtai P.Hajnal J.Komlós P.Pudlák V.Rödl E.Szemerédi G.Turán
Talks about:
group (6) graph (4) time (4) theori (3) bound (3) polynomi (2) isomorph (2) program (2) complex (2) random (2)

Person: László Babai

DBLP DBLP: Babai:L=aacute=szl=oacute=

Facilitated 1 volumes:

STOC 2004Ed

Contributed to:

STOC 20132013
ICALP (1) 20122012
STOC 20092009
STOC 19981998
STOC 19971997
STOC 19961996
STOC 19921992
STOC 19911991
STOC 19891989
STOC 19871987
STOC 19861986
STOC 19851985
STOC 19831983
STOC 19821982

Wrote 16 papers:

STOC-2013-BabaiW #canonical #design
Quasipolynomial-time canonical form for steiner designs (LB, JW), pp. 261–270.
ICALP-v1-2012-BabaiCQ #morphism #polynomial
Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups — (LB, PC, YQ), pp. 51–62.
STOC-2009-BabaiBS #matrix #polynomial
Polynomial-time theory of matrix groups (LB, RB, ÁS), pp. 55–64.
STOC-1998-BabaiHK #communication #complexity #cost analysis
The Cost of the Missing Bit: Communication Complexity with Help (LB, TPH, PGK), pp. 673–682.
STOC-1997-Babai #formal method
Paul Erdös (1913-1996): His Influence on the Theory of Computing (LB), pp. 383–401.
STOC-1996-BabaiGKRSW #bound #graph #source code
Extremal Bipartite Graphs and Superpolynomial Lower Bounds for Monotone Span Programs (LB, AG, JK, LR, TS, AW), pp. 603–611.
STOC-1992-BabaiBT #complexity #symmetry
Symmetry and Complexity (LB, RB, PTN), pp. 438–449.
STOC-1991-Babai #finite #generative #graph #random #transitive
Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups (LB), pp. 164–174.
STOC-1991-BabaiCFLS #algorithm #monte carlo #performance #permutation
Fast Monte Carlo Algorithms for Permutation Groups (LB, GC, LF, EML, ÁS), pp. 90–100.
Checking Computations in Polylogarithmic Time (LB, LF, LAL, MS), pp. 21–31.
STOC-1989-BabaiNS #multi #protocol #pseudo #sequence
Multiparty Protocols and Logspace-hard Pseudorandom Sequences (LB, NN, MS), pp. 1–11.
STOC-1987-BabaiLS #permutation
Permutation Groups in NC (LB, EML, ÁS), pp. 409–420.
STOC-1986-AjtaiBHKPRST #bound #branch #source code
Two lower bounds for branching programs (MA, LB, PH, JK, PP, VR, ES, GT), pp. 30–38.
Trading Group Theory for Randomness (LB), pp. 421–429.
STOC-1983-BabaiL #canonical #graph
Canonical Labeling of Graphs (LB, EML), pp. 171–183.
STOC-1982-BabaiGM #bound #graph #morphism #multi
Isomorphism of Graphs with Bounded Eigenvalue Multiplicity (LB, DYG, DMM), pp. 310–324.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.