Robert Beals

Publication Activity (10 Years)

Years Active: 1991-2009
Publications (10 Years): 0

Publications

László Babai, Robert Beals, Ákos Seress
Polynomial-time theory of matrix groups. STOC (2009)
Robert Beals
On Orders of Subgroups in Abelian Groups: An Elementary Solution of an Exercise of Herstein. Am. Math. Mon. 116 (10) (2009)
László Babai, Robert Beals, Ákos Seress
On the diameter of the symmetric group: polynomial bounds. SODA (2004)
Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress
Permutations With Restricted Cycle Structure And An Algorithmic Application. Comb. Probab. Comput. 11 (5) (2002)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum lower bounds by polynomials. J. ACM 48 (4) (2001)
Eric Allender, Robert Beals, Mitsunori Ogihara
The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Comput. Complex. 8 (2) (1999)
Robert Beals
Algorithms for Matrix Groups and the Tits Alternative. J. Comput. Syst. Sci. 58 (2) (1999)
Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán
On Finding the Number of Graph Automorphisms. Chic. J. Theor. Comput. Sci. 1999 (1999)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials. FOCS (1998)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials CoRR (1998)
Robert Beals, Tetsuro Nishino, Keisuke Tanaka
On the Complexity of Negation-Limited Boolean Networks. SIAM J. Comput. 27 (5) (1998)
Robert Beals
Quantum Computation of Fourier Transforms over Symmetric Groups. STOC (1997)
Robert Beals
Equivalence of Binary and Ternary Algebraic Decision Trees. Algorithmica 18 (4) (1997)
Eric Allender, Robert Beals, Mitsunori Ogihara
The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). STOC (1996)
László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks
Multiplicative Equations over Commuting Matrices. SODA (1996)
Keisuke Tanaka, Tetsuro Nishino, Robert Beals
Negation-Limited Circuit Complexity of Symmetric Functions. Inf. Process. Lett. 59 (5) (1996)
Eric Allender, Robert Beals, Mitsunori Ogihara
The complexity of matrix rank and feasible systems of linear equations Electron. Colloquium Comput. Complex. 3 (24) (1996)
Robert Beals, Tetsuro Nishino, Keisuke Tanaka
More on the complexity of negation-limited circuits. STOC (1995)
Robert Beals
Algorithms for Matrix Groups and the Tits Alternative. FOCS (1995)
Robert Beals
Towards polynomial time algorithms for matrix groups. Groups and Computation (1995)
M. D. Atkinson, Robert Beals
Priority Queues and Permutations. SIAM J. Comput. 23 (6) (1994)
Robert Beals
An Elementary Algorithm for Computing the Composition Factors of a Permutation Group. ISSAC (1993)
Robert Beals, László Babai
Las Vegas algorithms for matrix groups FOCS (1993)
László Babai, Robert Beals, Daniel N. Rockmore
Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time. ISSAC (1993)
László Babai, Robert Beals, Pál Takácsi-Nagy
Symmetry and Complexity STOC (1992)
Robert Beals, Ákos Seress
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time STOC (1992)
Robert Beals, Joseph A. Gallian, Patrick Headley, Douglas S. Jungreis
Harmonious groups. J. Comb. Theory, Ser. A 56 (2) (1991)
Robert Beals
Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 17. Groups And Computation (1991)