Abelian Permutation Group Problems and Logspace Counting Classes. - Vikraman Arvind; T. C. Vijayaraghavan (CCC, 2004)

Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. - Vikraman Arvind; Piyush P. Kurur; T. C. Vijayaraghavan (Electron. Colloquium Comput. Complex., 2004)

The Complexity of Solving Linear Equations over a Finite Ring. - Vikraman Arvind; T. C. Vijayaraghavan (STACS, 2005)

The Orbit problem is in the GapL Hierarchy. - Vikraman Arvind; T. C. Vijayaraghavan (Electron. Colloquium Comput. Complex., 2008)

Checking Equality of Matroid Linear Representations and the Cycle Matching Problem. - T. C. Vijayaraghavan (Electron. Colloquium Comput. Complex., 2009)

Characterization of ModL using Prime Modulus. - T. C. Vijayaraghavan (Electron. Colloquium Comput. Complex., 2009)

Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes. - Vikraman Arvind; T. C. Vijayaraghavan (Comput. Complex., 2010)

A Note on Closure Properties of ModL. - T. C. Vijayaraghavan (Electron. Colloquium Comput. Complex., 2010)

Some derivations among Logarithmic Space Bounded Counting Classes. - V. Janaki; S. Madhan; T. C. Vijayaraghavan (CoRR, 2023)

The Complexity of Logarithmic Space Bounded Counting Classes. - T. C. Vijayaraghavan (CoRR, 2025)