dblp.uni-trier.dewww.uni-trier.de

T. C. Vijayaraghavan

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
6EEVikraman Arvind, T. C. Vijayaraghavan: The Orbit Problem Is in the GapL Hierarchy. COCOON 2008: 160-169
5EEVikraman Arvind, T. C. Vijayaraghavan: The Orbit problem is in the GapL Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 15(052): (2008)
2005
4EEVikraman 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
3EEVikraman Arvind, T. C. Vijayaraghavan: The Complexity of Solving Linear Equations over a Finite Ring. STACS 2005: 472-484
2004
2EEVikraman Arvind, T. C. Vijayaraghavan: Abelian Permutation Group Problems and Logspace Counting Classes. IEEE Conference on Computational Complexity 2004: 204-214
1EEVikraman 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)

Coauthor Index

1Vikraman Arvind [1] [2] [3] [4] [5] [6]
2Piyush P. Kurur [1] [4]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)