default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Beals
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j11]Robert Beals:
On Orders of Subgroups in Abelian Groups: An Elementary Solution of an Exercise of Herstein. Am. Math. Mon. 116(10): 923-926 (2009)- [c15]László Babai
, Robert Beals, Ákos Seress:
Polynomial-time theory of matrix groups. STOC 2009: 55-64 - 2004
- [c14]László Babai, Robert Beals, Ákos Seress:
On the diameter of the symmetric group: polynomial bounds. SODA 2004: 1108-1112 - 2002
- [j10]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): 447-464 (2002) - 2001
- [j9]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum lower bounds by polynomials. J. ACM 48(4): 778-797 (2001)
1990 – 1999
- 1999
- [j8]Eric Allender, Robert Beals, Mitsunori Ogihara:
The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Comput. Complex. 8(2): 99-126 (1999) - [j7]Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán:
On Finding the Number of Graph Automorphisms. Chic. J. Theor. Comput. Sci. 1999 (1999) - [j6]Robert Beals:
Algorithms for Matrix Groups and the Tits Alternative. J. Comput. Syst. Sci. 58(2): 260-279 (1999) - 1998
- [j5]Robert Beals, Tetsuro Nishino, Keisuke Tanaka:
On the Complexity of Negation-Limited Boolean Networks. SIAM J. Comput. 27(5): 1334-1347 (1998) - [c13]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361 - [i2]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. CoRR quant-ph/9802049 (1998) - 1997
- [j4]Robert Beals:
Equivalence of Binary and Ternary Algebraic Decision Trees. Algorithmica 18(4): 521-523 (1997) - [c12]Robert Beals:
Quantum Computation of Fourier Transforms over Symmetric Groups. STOC 1997: 48-53 - 1996
- [j3]Keisuke Tanaka, Tetsuro Nishino, Robert Beals:
Negation-Limited Circuit Complexity of Symmetric Functions. Inf. Process. Lett. 59(5): 273-279 (1996) - [c11]László Babai, Robert Beals, Jin-yi Cai, Gábor Ivanyos, Eugene M. Luks:
Multiplicative Equations over Commuting Matrices. SODA 1996: 498-507 - [c10]Eric Allender, Robert Beals, Mitsunori Ogihara:
The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). STOC 1996: 161-167 - [i1]Eric Allender, Robert Beals, Mitsunori Ogihara:
The complexity of matrix rank and feasible systems of linear equations. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [c9]Robert Beals:
Towards polynomial time algorithms for matrix groups. Groups and Computation 1995: 31-54 - [c8]Robert Beals:
Algorithms for Matrix Groups and the Tits Alternative. FOCS 1995: 593-602 - [c7]Robert Beals, Tetsuro Nishino, Keisuke Tanaka:
More on the complexity of negation-limited circuits. STOC 1995: 585-595 - 1994
- [j2]M. D. Atkinson, Robert Beals:
Priority Queues and Permutations. SIAM J. Comput. 23(6): 1225-1230 (1994) - 1993
- [c6]Robert Beals, László Babai:
Las Vegas algorithms for matrix groups. FOCS 1993: 427-436 - [c5]László Babai, Robert Beals, Daniel N. Rockmore:
Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time. ISSAC 1993: 117-126 - [c4]Robert Beals:
An Elementary Algorithm for Computing the Composition Factors of a Permutation Group. ISSAC 1993: 127-134 - 1992
- [c3]Robert Beals, Ákos Seress:
Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time. STOC 1992: 116-125 - [c2]László Babai, Robert Beals, Pál Takácsi-Nagy:
Symmetry and Complexity. STOC 1992: 438-449 - 1991
- [j1]Robert Beals, Joseph A. Gallian, Patrick Headley, Douglas S. Jungreis:
Harmonious groups. J. Comb. Theory A 56(2): 223-238 (1991) - [c1]Robert Beals:
Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 17. Groups And Computation 1991: 17-26
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
