Robert Beals

Mathematics · Physical Sciences

18h-index2.0kcitations44works0.02yr avg
OpenAlex↗Google Scholar↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Finite Group Theory Research(13), Coding theory and cryptography(12), semigroups and automata theory(10), Complexity and Algorithms in Graphs(8), graph theory and CDMA systems(8)

Publications44 total

Testing Whether a Table Defines a Group
American Mathematical Monthly·2025
Finding Blocks of Imprimitivity When There is a Small-Base Action on Blocks
arXiv (Cornell University)·2025Open Access
A polynomial-time theory of black box groups I
Cambridge University Press eBooks·2013· 61 cited
Efficient distributed quantum computing
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences·2013· 211 citedOpen Access
On Orders of Subgroups in Abelian Groups: An Elementary Solution of an Exercise of Herstein
American Mathematical Monthly·2009· 1 cited
Polynomial-time theory of matrix groups
2009· 36 cited
ERRATUM
Mankind·2009Open Access
Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules
Journal of Algebra·2005· 5 cited
On the diameter of the symmetric group: polynomial bounds
Symposium on Discrete Algorithms·2004· 25 cited
A black-box group algorithm for recognizing finite symmetric and alternating groups, I
Transactions of the American Mathematical Society·2003· 34 citedOpen Access
Las Vegas algorithms for matrix groups
2002· 48 cited
Quantum lower bounds by polynomials
2002· 180 cited
Permutations with Restricted Cycle Structure and an Algorithmic Application
Combinatorics Probability Computing·2002· 26 cited
Quantum lower bounds by polynomials
Journal of the ACM·2001· 624 cited
On the proportions of certain types of elements of finite alternating and symmetric groups
2000· 1 cited
A melange of black-box algorithms for recognising finite symmetric and alternating groups, I
2000· 3 cited
Deciding finiteness for matrix groups over function fields
Israel Journal of Mathematics·1999· 11 cited
The complexity of matrix rank and feasible systems of linear equations
Computational Complexity·1999· 4 cited
Algorithms for Matrix Groups and the Tits Alternative
Journal of Computer and System Sciences·1999· 20 cited
On Finding the Number of Graph Automorphisms.
1999· 7 cited
page 1 of 3Next →

Frequent Co-authors

László Babai(8), Ákos Seress(8), C. R. Leedham-Green(5), Alice C. Niemeyer(5), Cheryl E. Praeger(5), Harry Buhrman(3), Richard Cleve(3), Michele Mosca(3), Ronald de Wolf(3), A. M. Mayyasi(3), A. E. Templeton(3), Tetsuro Nishino(3), Keisuke Tanaka(3), Gábor Ivanyos(2), Eugene M. Luks(2), Daniel N. Rockmore(2), Eric Allender(2), Mitsunori Ogihara(2), William Gasarch(2), Jacobo Torán(2)