Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Robert Beals
Observed names:
Beals, Robert,
R Beals,
R. Beals,
ROBERT BEALS
Institution:
Institute For Defense Analyses
Observed institutions:
Rutgers, The State University of New Jersey,
University of Arizona,
University of Oregon,
Princeton University,
Center for Discrete Mathematics and Theoretical Computer Science,
Institute For Defense Analyses,
Institute for Advanced Study,
University of Chicago
show all 8
OpenAlex ID:
A5113579141
Quantum lower bounds by polynomials
2001
·
Robert Beals
, Harry Buhrman
, et al.
·
Journal of the ACM
·
1,060
PDF
Efficient distributed quantum computing
2013
·
Robert Beals
, Stephen Brierley
, et al.
·
Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences
·
290
PDF
Quantum lower bounds by polynomials
2002
·
R. Beals
, H. Buhrman
, et al.
·
Annual Symposium on Foundations of Computer Science
·
211
Quantum computation of Fourier transforms over symmetric groups
1997
·
Robert Beals
·
ACM Symposium on Theory of Computing (STOC)
·
190
PDF
The complexity of matrix rank and feasible systems of linear equations
1999
·
E. Allender
, R. Beals
, et al.
·
Computational Complexity
·
102
Multiplicative equations over commuting matrices
1996
·
László Babai
, Robert Beals
, et al.
·
SZTAKI Publication Repository (Hungarian Academy of Sciences)
·
101
A polynomial-time theory of black box groups I
2013
·
L Babai
, R Beals
·
Cambridge University Press eBooks
·
61
Polynomial-time theory of matrix groups
2009
·
László Babai
, Robert Beals
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
57
Las Vegas algorithms for matrix groups
2002
·
R. Beals
, L. Babai
·
Annual Symposium on Foundations of Computer Science
·
52
On the diameter of the symmetric group: polynomial bounds
2004
·
László Babai
, Robert Beals
, et al.
·
Symposium on Discrete Algorithms
·
36
On the Complexity of Negation-Limited Boolean Networks
1998
·
Robert Beals
, Tetsuro Nishino
, et al.
·
SIAM Journal on Computing
·
33
Deciding finiteness of matrix groups in deterministic polynomial time
1993
·
László Babai
, Robert Beals
, et al.
·
International Symposium on Symbolic and Algebraic Computation
·
33
PDF
A black-box group algorithm for recognizing finite symmetric and alternating groups, I
2003
·
Robert Beals
, Charles Leedham-Green
, et al.
·
Transactions of the American Mathematical Society
·
32
PDF
Harmonious groups
1991
·
Robert Beals
, Joseph A Gallian
, et al.
·
Journal of Combinatorial Theory Series A
·
32
PDF
Algorithms for Matrix Groups and the Tits Alternative
1999
·
Robert Beals
·
Journal of Computer and System Sciences
·
24
PDF
Permutations with Restricted Cycle Structure and an Algorithmic Application
2002
·
ROBERT BEALS
, CHARLES R. LEEDHAM-GREEN
, et al.
·
Combinatorics Probability Computing
·
23
More on the complexity of negation-limited circuits
1995
·
Robert Beals
, Tetsuro Nishino
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
21
Negation-limited circuit complexity of symmetric functions
1996
·
Keisuke Tanaka
, Tetsuro Nishino
, et al.
·
Information Processing Letters
·
18
Symmetry and complexity
1992
·
László Babai
, Robert Beals
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
16
PDF
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
1996
·
Eric Allender
, Robert Beals
, et al.
·
ACM Symposium on Theory of Computing (STOC)
·
15
PDF
Computing blocks of imprimitivity for small-base groups in nearly linear time
1993
·
Robert Beals
·
DIMACS series in discrete mathematics and theoretical computer science
·
13
Structure forest and composition factors for small base groups in nearly linear time
1992
·
Robert Beals
, Ákos Seress
·
ACM Symposium on Theory of Computing (STOC)
·
13
Towards polynomial time algorithms for matrix groups
1997
·
Robert Beals
·
DIMACS series in discrete mathematics and theoretical computer science
·
11
Deciding finiteness for matrix groups over function fields
1999
·
Daniel N. Rockmore
, Ki-Seng Tan
, et al.
·
Israel Journal of Mathematics
·
10
Constructive recognition of finite alternating and symmetric groups acting as matrix groups on their natural permutation modules
2005
·
Robert Beals
, Charles R. Leedham-Green
, et al.
·
Journal of Algebra
·
9
Show more works
View as search
Works count:
42
Citation count:
2,499
H-index:
18
I10-index:
24
Year
Topic
Type