László Babai

Algorithms & Complexity · 1979–2015

A researcher in the Science corpus: 10 papers; trusts 3 researchers and is trusted by 38 researchers here, as inferred from the citation graph.

Subfields

• Algorithms & Complexity — 18 citations into it; #216 of 516 by trust here, #241 by citations

Whom László Babai trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Eugene M. Luks
2. Gary L. Miller
3. David S. Johnson
4. Jacob T. Schwartz
5. Á. Seress
6. Michael Ben-Or

Who trusts László Babai overall

1. Eli Ben-Sasson
2. B. Douglas
3. Oleg Pikhurko
4. Christopher Morris
5. Jin-Yi Cai
6. Igor Pak
7. Srinath T. V. Setty
8. Oded Goldreich
9. William L. Hamilton
10. Oleg Verbitsky

Papers from László Babai's perspective

Ordered by how strongly the researchers László Babai trusts endorse each paper. Same corpus, a different order for every researcher.

1. Random Graph Isomorphism
2. Matrix multiplication via arithmetic progressions
3. The Magma Algebra System I: The User Language
4. A Note on the Graph Isomorphism counting Problem
5. Interior-point polynomial algorithms in convex programming
6. Protocols for secure computations
7. Reductions in streaming algorithms, with an application to counting triangles in graphs (ACM-SIAM Symposium on Discrete Algorithms)
8. IP = PSPACE
9. The Complexity of Computing the Permanent
10. Approximate clustering via core-sets (Symposium on the Theory of Computing)

Their papers

• Graph isomorphism in quasipolynomial time [extended abstract] (2015) — 632 citations
• Non-deterministic exponential time has two-prover interactive protocols (2005) — 506 citations
• On the number of zero-patterns of a sequence of polynomials (2001) — 46 citations
• Automorphism groups, isomorphism, reconstruction (1996)
• Checking computations in polylogarithmic time (1991)
• Computational complexity and the classification of finite simple groups (1983)
• Canonical labeling of graphs (1983)
• Isomorphism of graphs with bounded eigenvalue multiplicity (1982)
• Random Graph Isomorphism (1980)
• Canonical labelling of graphs in linear average time (1979)