| Testing nilpotence of galois groups in polynomial time | 1 | 0.44 | 2012 |
| The orbit problem is in the GapL hierarchy | 5 | 0.66 | 2011 |
| Isomorphism and canonization of tournaments and hypertournaments | 4 | 0.48 | 2010 |
| Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes | 0 | 0.34 | 2010 |
| On Lower Bounds for Constant Width Arithmetic Circuits | 2 | 0.41 | 2009 |
| Algorithmic problems for metrics on permutation groups | 2 | 0.39 | 2008 |
| Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size | 19 | 0.74 | 2008 |
| Some Sieving Algorithms for Lattice Problems | 10 | 0.55 | 2008 |
| Lattice Problems, Gauge Functions and Parameterized Algorithms | 0 | 0.34 | 2008 |
| SZK Proofs for Black-Box Group Problems | 2 | 0.36 | 2008 |
| The ideal membership problem and polynomial identity testing | 0 | 0.34 | 2007 |
| The monomial ideal membership problem and polynomial identity testing | 17 | 0.78 | 2007 |
| The complexity of black-box ring problems | 2 | 0.45 | 2006 |
| Graph isomorphism is in SPP | 35 | 1.65 | 2006 |
| The complexity of solving linear equations over a finite ring | 3 | 0.44 | 2005 |
| Non-stabilizer quantum codes from abelian subggroups of the error group | 2 | 0.45 | 2004 |
| Abelian Permutation Group Problems and Logspace Counting Classes | 5 | 0.57 | 2004 |
| Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy | 5 | 0.45 | 2004 |
| New Lowness Results for ZPPNP and Other Complexity Classes | 2 | 0.37 | 2002 |
| Exact learning via teaching assistants | 0 | 0.34 | 2000 |
| The counting complexity of group-definable languages | 2 | 0.38 | 2000 |
| A nonadaptive NC checker for permutation group intersection | 3 | 0.40 | 1997 |
| Exact Learning via Teaching Assistants (Extended Abstract) | 0 | 0.34 | 1997 |
| The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract) | 1 | 0.36 | 1996 |
