Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 17. - Robert Beals (Groups And Computation, 1991)

Harmonious groups. - Robert Beals; Joseph A. Gallian; Patrick Headley; Douglas S. Jungreis (J. Comb. Theory A, 1991)

Symmetry and Complexity - László Babai; Robert Beals; Pál Takácsi-Nagy (STOC, 1992)

Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time - Robert Beals; Ákos Seress (STOC, 1992)

Las Vegas algorithms for matrix groups - Robert Beals; László Babai (FOCS, 1993)

Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time. - László Babai; Robert Beals; Daniel N. Rockmore (ISSAC, 1993)

An Elementary Algorithm for Computing the Composition Factors of a Permutation Group. - Robert Beals (ISSAC, 1993)

Priority Queues and Permutations. - M. D. Atkinson; Robert Beals (SIAM J. Comput., 1994)

Towards polynomial time algorithms for matrix groups. - Robert Beals (Groups and Computation, 1995)

More on the complexity of negation-limited circuits. - Robert Beals; Tetsuro Nishino; Keisuke Tanaka (STOC, 1995)

Multiplicative Equations over Commuting Matrices. - László Babai; Robert Beals; Jin-yi Cai; Gábor Ivanyos; Eugene M. Luks (SODA, 1996)

The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). - Eric Allender; Robert Beals; Mitsunori Ogihara (STOC, 1996)

Negation-Limited Circuit Complexity of Symmetric Functions. - Keisuke Tanaka; Tetsuro Nishino; Robert Beals (Inf. Process. Lett., 1996)

Quantum Computation of Fourier Transforms over Symmetric Groups. - Robert Beals (STOC, 1997)

Equivalence of Binary and Ternary Algebraic Decision Trees. - Robert Beals (Algorithmica, 1997)

On the Complexity of Negation-Limited Boolean Networks. - Robert Beals; Tetsuro Nishino; Keisuke Tanaka (SIAM J. Comput., 1998)

The Complexity of Matrix Rank and Feasible Systems of Linear Equations. - Eric Allender; Robert Beals; Mitsunori Ogihara (Comput. Complex., 1999)

On Finding the Number of Graph Automorphisms. - Robert Beals; Richard Chang 001; William I. Gasarch; Jacobo Torán (Chic. J. Theor. Comput. Sci., 1999)

Algorithms for Matrix Groups and the Tits Alternative. - Robert Beals (J. Comput. Syst. Sci., 1999)

Quantum lower bounds by polynomials. - Robert Beals; Harry Buhrman; Richard Cleve; Michele Mosca; Ronald de Wolf (J. ACM, 2001)

Permutations With Restricted Cycle Structure And An Algorithmic Application. - Robert Beals; Charles R. Leedham-Green; Alice C. Niemeyer; Cheryl E. Praeger; Ákos Seress (Comb. Probab. Comput., 2002)

On the diameter of the symmetric group: polynomial bounds. - László Babai; Robert Beals; Ákos Seress (SODA, 2004)

Polynomial-time theory of matrix groups. - László Babai; Robert Beals; Ákos Seress (STOC, 2009)

On Orders of Subgroups in Abelian Groups: An Elementary Solution of an Exercise of Herstein. - Robert Beals (Am. Math. Mon., 2009)