The SCEAS System
| |||||||

## Search the dblp DataBase
Robert Beals:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Robert Beals
**Algorithms for Matrix Groups and the Tits Alternative.**[Citation Graph (0, 0)][DBLP] FOCS, 1995, pp:593-602 [Conf] - Robert Beals, László Babai
**Las Vegas algorithms for matrix groups**[Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:427-436 [Conf] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
**Quantum Lower Bounds by Polynomials.**[Citation Graph (0, 0)][DBLP] FOCS, 1998, pp:352-361 [Conf] - Robert Beals
**An Elementary Algorithm for Computing the Composition Factors of a Permutation Group.**[Citation Graph (0, 0)][DBLP] ISSAC, 1993, pp:127-134 [Conf] - László Babai, Robert Beals, Daniel N. Rockmore
**Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time.**[Citation Graph (0, 0)][DBLP] ISSAC, 1993, pp:117-126 [Conf] - László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks
**Multiplicative Equations over Commuting Matrices.**[Citation Graph (0, 0)][DBLP] SODA, 1996, pp:498-507 [Conf] - László Babai, Robert Beals, Ákos Seress
**On the diameter of the symmetric group: polynomial bounds.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1108-1112 [Conf] - Eric Allender, Robert Beals, Mitsunori Ogihara
**The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract).**[Citation Graph (0, 0)][DBLP] STOC, 1996, pp:161-167 [Conf] - László Babai, Robert Beals, Pál Takácsi-Nagy
**Symmetry and Complexity**[Citation Graph (0, 0)][DBLP] STOC, 1992, pp:438-449 [Conf] - Robert Beals
**Quantum Computation of Fourier Transforms over Symmetric Groups.**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:48-53 [Conf] - Robert Beals, Tetsuro Nishino, Keisuke Tanaka
**More on the complexity of negation-limited circuits.**[Citation Graph (0, 0)][DBLP] STOC, 1995, pp:585-595 [Conf] - Robert Beals, Ákos Seress
**Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time**[Citation Graph (0, 0)][DBLP] STOC, 1992, pp:116-125 [Conf] - Robert Beals
**Equivalence of Binary and Ternary Algebraic Decision Trees.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1997, v:18, n:4, pp:521-523 [Journal] - Eric Allender, Robert Beals, Mitsunori Ogihara
**The Complexity of Matrix Rank and Feasible Systems of Linear Equations.**[Citation Graph (0, 0)][DBLP] Computational Complexity, 1999, v:8, n:2, pp:99-126 [Journal] - Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán
**On Finding the Number of Graph Automorphisms.**[Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
**Quantum Lower Bounds by Polynomials**[Citation Graph (0, 0)][DBLP] CoRR, 1998, v:0, n:, pp:- [Journal] - Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress
**Permutations With Restricted Cycle Structure And An Algorithmic Application.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 2002, v:11, n:5, pp:- [Journal] - Eric Allender, Robert Beals, Mitsunori Ogihara
**The complexity of matrix rank and feasible systems of linear equations**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:24, pp:- [Journal] - Keisuke Tanaka, Tetsuro Nishino, Robert Beals
**Negation-Limited Circuit Complexity of Symmetric Functions.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1996, v:59, n:5, pp:273-279 [Journal] - Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
**Quantum lower bounds by polynomials.**[Citation Graph (0, 0)][DBLP] J. ACM, 2001, v:48, n:4, pp:778-797 [Journal] - Robert Beals
**Algorithms for Matrix Groups and the Tits Alternative.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1999, v:58, n:2, pp:260-279 [Journal] - Robert Beals, Joseph A. Gallian, Patrick Headley, Douglas S. Jungreis
**Harmonious groups.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1991, v:56, n:2, pp:223-238 [Journal] - M. D. Atkinson, Robert Beals
**Priority Queues and Permutations.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1994, v:23, n:6, pp:1225-1230 [Journal] - Robert Beals, Tetsuro Nishino, Keisuke Tanaka
**On the Complexity of Negation-Limited Boolean Networks.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:27, n:5, pp:1334-1347 [Journal] **Polynomial-time theory of matrix groups.**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.005secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |