| 2009 | STOC | Polynomial-time theory of matrix groups. | Lszl Babai, Robert Beals, kos Seress |
| 2004 | SODA | On the diameter of the symmetric group: polynomial bounds. | Lszl Babai, Robert Beals, kos Seress |
| 1998 | FOCS | Quantum Lower Bounds by Polynomials. | Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf |
| 1997 | STOC | Quantum Computation of Fourier Transforms over Symmetric Groups. | Robert Beals |
| 1996 | SODA | Multiplicative Equations over Commuting Matrices. | Lszl Babai, Robert Beals, Jin-yi Cai, Gbor Ivanyos, Eugene M. Luks |
| 1996 | STOC | The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). | Eric Allender, Robert Beals, Mitsunori Ogihara |
| 1995 | FOCS | Algorithms for Matrix Groups and the Tits Alternative. | Robert Beals |
| 1995 | STOC | More on the complexity of negation-limited circuits. | Robert Beals, Tetsuro Nishino, Keisuke Tanaka |
| 1993 | FOCS | Las Vegas algorithms for matrix groups | Robert Beals, Lszl Babai |
| 1993 | ISSAC | Deciding Finiteness of Matrix Groups in Deterministic Polynomial Time. | Lszl Babai, Robert Beals, Daniel N. Rockmore |
| 1993 | ISSAC | An Elementary Algorithm for Computing the Composition Factors of a Permutation Group. | Robert Beals |
| 1992 | STOC | Symmetry and Complexity | Lszl Babai, Robert Beals, Pl Takcsi-Nagy |
| 1992 | STOC | Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time | Robert Beals, kos Seress |