| 2008 |
|---|
| 6 | EE | Vikraman Arvind,
T. C. Vijayaraghavan:
The Orbit Problem Is in the GapL Hierarchy.
COCOON 2008: 160-169 |
| 5 | EE | Vikraman Arvind,
T. C. Vijayaraghavan:
The Orbit problem is in the GapL Hierarchy.
Electronic Colloquium on Computational Complexity (ECCC) 15(052): (2008) |
| 2005 |
|---|
| 4 | EE | Vikraman Arvind,
Piyush P. Kurur,
T. C. Vijayaraghavan:
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
IEEE Conference on Computational Complexity 2005: 13-27 |
| 3 | EE | Vikraman Arvind,
T. C. Vijayaraghavan:
The Complexity of Solving Linear Equations over a Finite Ring.
STACS 2005: 472-484 |
| 2004 |
|---|
| 2 | EE | Vikraman Arvind,
T. C. Vijayaraghavan:
Abelian Permutation Group Problems and Logspace Counting Classes.
IEEE Conference on Computational Complexity 2004: 204-214 |
| 1 | EE | Vikraman Arvind,
Piyush P. Kurur,
T. C. Vijayaraghavan:
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
Electronic Colloquium on Computational Complexity (ECCC)(121): (2004) |
