| 2012 | ISSAC | Construction of 2-closed M-representations. | kos Seress |
| 2009 | STOC | Polynomial-time theory of matrix groups. | Lszl Babai, Robert Beals, kos Seress |
| 2006 | ISSAC | A data structure for a uniform approach to computations with finite groups. | Max Neunhffer, kos Seress |
| 2004 | SODA | On the diameter of the symmetric group: polynomial bounds. | Lszl Babai, Robert Beals, kos Seress |
| 1994 | ISSAC | Finding Blocks of Imprimitivity in Small-Base Groups in Nearly Linear Time. | Martin Schnert, kos Seress |
| 1992 | STOC | Structure Forest and Composition Factors for Small Base Groups in Nearly Linear Time | Robert Beals, kos Seress |
| 1991 | ISSAC | Nearly Linear Time Algorithms for Permutation Groups with a Small Base. | Lszl Babai, Gene Cooperman, Larry Finkelstein, kos Seress |
| 1991 | STOC | Fast Monte Carlo Algorithms for Permutation Groups | Lszl Babai, Gene Cooperman, Larry Finkelstein, Eugene M. Luks, kos Seress |
| 1990 | FOCS | On the Diameter of Finite Groups | Lszl Babai, Gbor Hetyei, William M. Kantor, Alexander Lubotzky, kos Seress |
| 1988 | FOCS | Fast Management of Permutation Groups | Lszl Babai, Eugene M. Luks, kos Seress |
| 1987 | STOC | Permutation Groups in NC | Lszl Babai, Eugene M. Luks, kos Seress |