1. Lecture Notes in Computer Science;M. Agrawal,2005
2. Àlvarez, C., Jenner, B.: A very hard log-space counting class. Theoretical Computer Science 107(1), 3–30 (1993)
3. Lecture Notes in Computer Science;V. Arvind,2006
4. Arvind, V., Kurur, P., Vijayaraghavan, T.: Bounded color multiplicity graph isomorphism is in the #L hierarchy. In: Proc. 20th Annual IEEE Conference on Computational Complexity, pp. 13–27. IEEE Computer Society Press, Los Alamitos (2005)
5. Arvind, V., Torán, J.: Isomorphism testing: Pespective and open problems. Bulletin of the European Association of Theoretical Computer Science (BEATCS) 86 (2005)