| Group Isomorphism with Fixed Subnormal Chains | 0 | 0.34 | 2015 |
| Polynomial-time normalizers. | 0 | 0.34 | 2011 |
| Generalizing Boolean satisfiability II: theory | 10 | 0.56 | 2011 |
| Generalizing Boolean satisfiability III: implementation | 8 | 0.47 | 2011 |
| Combinatorics of Singly-Repairable Families | 1 | 0.38 | 2005 |
| Implementing a generalized version of resolution | 4 | 0.48 | 2004 |
| The Complexity of Symmetry-Breaking Formulas | 7 | 0.82 | 2004 |
| Polynomial-time normalizers for permutation groups with restricted composition factors | 4 | 0.56 | 2002 |
| Symmetry Breaking in Constraint Satisfaction | 2 | 0.39 | 2002 |
| Hypergraph isomorphism and structural equivalence of Boolean functions | 15 | 0.85 | 1999 |
| Sylow subgroups in parallel | 0 | 0.34 | 1999 |
| Fast Management of Permutation Groups I | 26 | 2.89 | 1997 |
| Some algorithms for nilpotent permutation groups | 2 | 0.37 | 1997 |
| Multiplicative equations over commuting matrices | 28 | 1.88 | 1996 |
| Symmetry-Breaking Predicates for Search Problems | 219 | 12.33 | 1996 |
| Computing the Fitting subgoup and solvable radical for small-basepermutation groups in nearly linear time. | 3 | 0.56 | 1995 |
| Computing normalizers in permutation p-groups | 3 | 0.50 | 1994 |
| Computing in solvable matrix groups | 20 | 2.54 | 1992 |
| Permutation groups and polynomial-time computation | 55 | 3.30 | 1991 |
| Fast Monte Carlo algorithms for permutation groups | 34 | 2.69 | 1991 |
| Computing Composition Series in Primitive Groups. | 2 | 0.58 | 1991 |
| Computing in quotient groups | 14 | 1.82 | 1990 |
| Parallel algorithms for solvable permutation groups | 12 | 1.10 | 1988 |
| Permutation groups in NC | 39 | 4.81 | 1987 |
| An O(n3log n) deterministic and an O(n3) Las Vegs isomorphism test for trivalent graphs | 6 | 0.56 | 1987 |
| Computing the composition factors of a permutation group in polynomial time | 25 | 3.29 | 1987 |
| Parallel algorithms for permutation groups and graph isomorphism | 33 | 2.63 | 1986 |
| Fast parallel computation with permutation groups | 10 | 2.43 | 1985 |
| Canonical labeling of graphs | 111 | 5.60 | 1983 |
| Computational complexity and the classification of finite simple groups | 38 | 5.06 | 1983 |
| An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs | 1 | 0.51 | 1982 |
| Isomorphism of graphs of bounded valence can be tested in polynomial time | 306 | 102.79 | 1982 |
| Polynomial-Time Algorithms for Permutation Groups | 150 | 136.19 | 1980 |
