Robert Beals

According to our database1, Robert Beals authored at least 24 papers between 1991 and 2009.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

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

Polynomial-time theory of matrix groups.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2004
On the diameter of the symmetric group: polynomial bounds.
Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

2002
Permutations With Restricted Cycle Structure And An Algorithmic Application.
Comb. Probab. Comput., 2002

2001
Quantum lower bounds by polynomials.
J. ACM, 2001

1999
Algorithms for Matrix Groups and the Tits Alternative.
J. Comput. Syst. Sci., 1999

On Finding the Number of Graph Automorphisms.
Chic. J. Theor. Comput. Sci., 1999

The Complexity of Matrix Rank and Feasible Systems of Linear Equations.
Comput. Complex., 1999

1998
On the Complexity of Negation-Limited Boolean Networks.
SIAM J. Comput., 1998

1997
Equivalence of Binary and Ternary Algebraic Decision Trees.
Algorithmica, 1997

Quantum Computation of Fourier Transforms over Symmetric Groups.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
Negation-Limited Circuit Complexity of Symmetric Functions.
Inf. Process. Lett., 1996

The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996

Multiplicative Equations over Commuting Matrices.
Proceedings of the Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 1996

1995
More on the complexity of negation-limited circuits.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

Towards polynomial time algorithms for matrix groups.
Proceedings of the Groups and Computation, 1995

1994
Priority Queues and Permutations.
SIAM J. Comput., 1994

1993
An Elementary Algorithm for Computing the Composition Factors of a Permutation Group.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time.
Proceedings of the 1993 International Symposium on Symbolic and Algebraic Computation, 1993

Las Vegas algorithms for matrix groups
Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993

1992
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

Symmetry and Complexity
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992

1991
Harmonious groups.
J. Comb. Theory A, 1991

Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 17.
Proceedings of the Groups And Computation, 1991


  Loading...