Robert Beals - RankMe

28 papers A* 11B 2Journal 13Unranked 2

Year	Rank	Type	Title / Venue / Authors
2009	J	`jnl`	On Orders of Subgroups in Abelian Groups: An Elementary Solution of an Exercise of Herstein. Am. Math. Mon. Robert Beals
2009	A*	`conf`	Polynomial-time theory of matrix groups. STOC László Babai, Robert Beals, Ákos Seress
2004	A*	`conf`	On the diameter of the symmetric group: polynomial bounds. SODA László Babai, Robert Beals, Ákos Seress
2002	J	`jnl`	Permutations With Restricted Cycle Structure And An Algorithmic Application. Comb. Probab. Comput. Robert Beals, Charles R. Leedham-Green, Alice C. Niemeyer, Cheryl E. Praeger, Ákos Seress
2001	J	`jnl`	Quantum lower bounds by polynomials. J. ACM Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1999	J	`jnl`	Algorithms for Matrix Groups and the Tits Alternative. J. Comput. Syst. Sci. Robert Beals
1999	J	`jnl`	On Finding the Number of Graph Automorphisms. Chic. J. Theor. Comput. Sci. Robert Beals, Richard Chang, William I. Gasarch, Jacobo Torán
1999	J	`jnl`	The Complexity of Matrix Rank and Feasible Systems of Linear Equations. Comput. Complex. Eric Allender, Robert Beals, Mitsunori Ogihara
1998	J	`jnl`	On the Complexity of Negation-Limited Boolean Networks. SIAM J. Comput. Robert Beals, Tetsuro Nishino, Keisuke Tanaka
1998	J	`jnl`	Quantum Lower Bounds by Polynomials CoRR Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1998	A*	`conf`	Quantum Lower Bounds by Polynomials. FOCS Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1997	J	`jnl`	Equivalence of Binary and Ternary Algebraic Decision Trees. Algorithmica Robert Beals
1997	A*	`conf`	Quantum Computation of Fourier Transforms over Symmetric Groups. STOC Robert Beals
1996	A*	`conf`	Multiplicative Equations over Commuting Matrices. SODA László Babai, Robert Beals, Jin-Yi Cai, Gábor Ivanyos, Eugene M. Luks
1996	J	`jnl`	Negation-Limited Circuit Complexity of Symmetric Functions. Inf. Process. Lett. Keisuke Tanaka, Tetsuro Nishino, Robert Beals
1996	A*	`conf`	The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). STOC Eric Allender, Robert Beals, Mitsunori Ogihara
1996	J	`jnl`	The complexity of matrix rank and feasible systems of linear equations Electron. Colloquium Comput. Complex. Eric Allender, Robert Beals, Mitsunori Ogihara
1995	A*	`conf`	Algorithms for Matrix Groups and the Tits Alternative. FOCS Robert Beals
1995	A*	`conf`	More on the complexity of negation-limited circuits. STOC Robert Beals, Tetsuro Nishino, Keisuke Tanaka
1995	—	`conf`	Towards polynomial time algorithms for matrix groups. Groups and Computation Robert Beals
1994	J	`jnl`	Priority Queues and Permutations. SIAM J. Comput. M. D. Atkinson, Robert Beals
1993	B	`conf`	An Elementary Algorithm for Computing the Composition Factors of a Permutation Group. ISSAC Robert Beals
1993	B	`conf`	Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time. ISSAC László Babai, Robert Beals, Daniel N. Rockmore
1993	A*	`conf`	Las Vegas algorithms for matrix groups FOCS Robert Beals, László Babai
1992	A*	`conf`	Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time STOC Robert Beals, Ákos Seress
1992	A*	`conf`	Symmetry and Complexity STOC László Babai, Robert Beals, Pál Takácsi-Nagy
1991	—	`conf`	Computing Blocks of Imprimitivity for Small-Base Groups in Nearly Linear Time 17. Groups And Computation Robert Beals
1991	J	`jnl`	Harmonious groups. J. Comb. Theory A Robert Beals, Joseph A. Gallian, Patrick Headley, Douglas S. Jungreis