| Graph isomorphism in quasipolynomial time [extended abstract]. | 35 | 1.32 | 2016 |
| The Graph Isomorphism Problem (Dagstuhl Seminar 15511). | 2 | 0.39 | 2015 |
| Graph Isomorphism in Quasipolynomial Time | 67 | 2.64 | 2015 |
| On the automorphism groups of strongly regular graphs I | 3 | 0.39 | 2014 |
| Proportions of r-regular elements in finite classical groups. | 0 | 0.34 | 2013 |
| Quasipolynomial-time canonical form for steiner designs | 5 | 0.64 | 2013 |
| Faster Canonical Forms for Strongly Regular Graphs | 7 | 0.67 | 2013 |
| Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. | 9 | 0.66 | 2012 |
| Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups - (Extended Abstract). | 6 | 0.68 | 2012 |
| Code Equivalence and Group Isomorphism | 17 | 1.21 | 2011 |
| Finite groups and complexity theory: from leningrad to saint petersburg via las vegas | 0 | 0.34 | 2011 |
| Weights of exact threshold functions | 5 | 0.50 | 2010 |
| Evasiveness and the Distribution of Prime Numbers | 8 | 0.52 | 2010 |
| Spectral extrema for graphs: the Zarankiewicz problem | 2 | 0.47 | 2009 |
| Polynomial-time theory of matrix groups | 13 | 0.71 | 2009 |
| Computing rank-convolutions with a mask | 3 | 0.46 | 2009 |
| Product growth and mixing in finite groups | 3 | 0.40 | 2008 |
| Isomorhism of Hypergraphs of Low Rank in Moderately Exponential Time | 10 | 0.78 | 2008 |
| Property Testing of Equivalence under a Permutation Group Action | 2 | 0.43 | 2008 |
| Sandpile transience on the grid is polynomially bounded | 5 | 0.60 | 2007 |
| Special Issue Dedicated To The Thirty-Sixth Annual ACM Symposium On Theory Of Computing (STOC 2004) | 0 | 0.34 | 2006 |
| Robust mixing | 1 | 0.37 | 2006 |
| On the diameter of Eulerian orientations of graphs | 8 | 0.61 | 2006 |
| Near-independence of permutations and an almost sure polynomial bound on the diameter of the symmetric group | 11 | 0.66 | 2005 |
| Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004 | 45 | 11.56 | 2004 |
| On the diameter of the symmetric group: polynomial bounds | 6 | 0.55 | 2004 |
| Simultaneous diophantine approximation with excluded primes | 0 | 0.34 | 2004 |
| Communication Complexity of Simultaneous Messages | 30 | 1.10 | 2003 |
| The Cost of the Missing Bit: Communication Complexity with Help | 25 | 1.24 | 2001 |
| Set systems with restricted intersections modulo prime powers | 12 | 0.91 | 2001 |
| Strong bias of group generators: an obstacle to the "product replacement algorithm" | 5 | 0.65 | 2000 |
| Automorphisms and Enumeration of Switching Classes of Tournaments | 5 | 1.11 | 2000 |
| Superpolynomial Lower Bounds for Monotone Span Programs | 31 | 1.39 | 1999 |
| Stronger Separations for Random-Self-Reducibility, Rounds, and Advice | 3 | 0.47 | 1999 |
| Paul Erdös (1913-996): his influence on the theory of computing | 0 | 0.34 | 1997 |
| Fast Management of Permutation Groups I | 26 | 2.89 | 1997 |
| Randomized Simultaneous Messages: Solution Of A Problem Of Yao In Communication Complexity | 24 | 1.54 | 1997 |
| The growth rate of vertex-transitive planar graphs | 4 | 1.13 | 1997 |
| Multiplicative equations over commuting matrices | 28 | 1.88 | 1996 |
| Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs | 14 | 1.15 | 1996 |
| Randomization in group algorithms: conceptual questions | 13 | 1.25 | 1995 |
| A new proof of several inequalities on codes and sets | 11 | 1.51 | 1995 |
| Permutation Groups without Exponentially Many Orbits on the Power Set. | 0 | 0.34 | 1994 |
| Permutation groups without exponentially many orbits on the power set | 2 | 0.40 | 1994 |
| Eulerian Self-Dual Codes | 1 | 0.45 | 1994 |
| Decomposition of *-closed algebras in polynomial time | 1 | 0.39 | 1993 |
| Transparent (Holographic) Proofs | 6 | 1.02 | 1993 |
| Las Vegas algorithms for matrix groups | 20 | 1.90 | 1993 |
| On the diameter of permutation groups. | 14 | 1.17 | 1992 |
| Bounded round interactive proofs in finite groups | 26 | 2.11 | 1992 |
