| 2004 |
| 24 | EE | László Babai,
Robert Beals,
Ákos Seress:
On the diameter of the symmetric group: polynomial bounds.
SODA 2004: 1108-1112 |
| 2002 |
| 23 | | Robert Beals,
Charles R. Leedham-Green,
Alice C. Niemeyer,
Cheryl E. Praeger,
Ákos Seress:
Permutations With Restricted Cycle Structure And An Algorithmic Application.
Combinatorics, Probability & Computing 11(5): (2002) |
| 2001 |
| 22 | EE | Robert Beals,
Harry Buhrman,
Richard Cleve,
Michele Mosca,
Ronald de Wolf:
Quantum lower bounds by polynomials.
J. ACM 48(4): 778-797 (2001) |
| 1999 |
| 21 | EE | Robert Beals,
Richard Chang,
William I. Gasarch,
Jacobo Torán:
On Finding the Number of Graph Automorphisms.
Chicago J. Theor. Comput. Sci. 1999: (1999) |
| 20 | | Eric Allender,
Robert Beals,
Mitsunori Ogihara:
The Complexity of Matrix Rank and Feasible Systems of Linear Equations.
Computational Complexity 8(2): 99-126 (1999) |
| 19 | | Robert Beals:
Algorithms for Matrix Groups and the Tits Alternative.
J. Comput. Syst. Sci. 58(2): 260-279 (1999) |
| 1998 |
| 18 | EE | Robert Beals,
Harry Buhrman,
Richard Cleve,
Michele Mosca,
Ronald de Wolf:
Quantum Lower Bounds by Polynomials.
FOCS 1998: 352-361 |
| 17 | EE | Robert Beals,
Harry Buhrman,
Richard Cleve,
Michele Mosca,
Ronald de Wolf:
Quantum Lower Bounds by Polynomials
CoRR quant-ph/9802049: (1998) |
| 16 | EE | Robert Beals,
Tetsuro Nishino,
Keisuke Tanaka:
On the Complexity of Negation-Limited Boolean Networks.
SIAM J. Comput. 27(5): 1334-1347 (1998) |
| 1997 |
| 15 | EE | Robert Beals:
Quantum Computation of Fourier Transforms over Symmetric Groups.
STOC 1997: 48-53 |
| 14 | | Robert Beals:
Equivalence of Binary and Ternary Algebraic Decision Trees.
Algorithmica 18(4): 521-523 (1997) |
| 1996 |
| 13 | | László Babai,
Robert Beals,
Jin-yi Cai,
Gábor Ivanyos,
Eugene M. Luks:
Multiplicative Equations over Commuting Matrices.
SODA 1996: 498-507 |
| 12 | EE | Eric Allender,
Robert Beals,
Mitsunori Ogihara:
The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract).
STOC 1996: 161-167 |
| 11 | EE | Eric Allender,
Robert Beals,
Mitsunori Ogihara:
The complexity of matrix rank and feasible systems of linear equations
Electronic Colloquium on Computational Complexity (ECCC) 3(24): (1996) |
| 10 | EE | Keisuke Tanaka,
Tetsuro Nishino,
Robert Beals:
Negation-Limited Circuit Complexity of Symmetric Functions.
Inf. Process. Lett. 59(5): 273-279 (1996) |
| 1995 |
| 9 | | Robert Beals:
Algorithms for Matrix Groups and the Tits Alternative.
FOCS 1995: 593-602 |
| 8 | EE | Robert Beals,
Tetsuro Nishino,
Keisuke Tanaka:
More on the complexity of negation-limited circuits.
STOC 1995: 585-595 |
| 1994 |
| 7 | | M. D. Atkinson,
Robert Beals:
Priority Queues and Permutations.
SIAM J. Comput. 23(6): 1225-1230 (1994) |
| 1993 |
| 6 | | Robert Beals,
László Babai:
Las Vegas algorithms for matrix groups
FOCS 1993: 427-436 |
| 5 | EE | László Babai,
Robert Beals,
Daniel N. Rockmore:
Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time.
ISSAC 1993: 117-126 |
| 4 | EE | Robert Beals:
An Elementary Algorithm for Computing the Composition Factors of a Permutation Group.
ISSAC 1993: 127-134 |
| 1992 |
| 3 | | Robert Beals,
Ákos Seress:
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time
STOC 1992: 116-125 |
| 2 | | László Babai,
Robert Beals,
Pál Takácsi-Nagy:
Symmetry and Complexity
STOC 1992: 438-449 |
| 1991 |
| 1 | EE | Robert Beals,
Joseph A. Gallian,
Patrick Headley,
Douglas S. Jungreis:
Harmonious groups.
J. Comb. Theory, Ser. A 56(2): 223-238 (1991) |