2009 |
14 | EE | Sagarmoy Dutta,
Piyush P. Kurur:
Representating groups on graphs
CoRR abs/0904.3941: (2009) |
2008 |
13 | EE | Anindya De,
Piyush P. Kurur,
Chandan Saha,
Ramprasad Saptharishi:
Fast integer multiplication using modular arithmetic.
STOC 2008: 499-506 |
12 | EE | Anindya De,
Piyush P. Kurur,
Chandan Saha,
Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic
CoRR abs/0801.1416: (2008) |
11 | EE | Anindya De,
Piyush P. Kurur,
Chandan Saha,
Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic.
Electronic Colloquium on Computational Complexity (ECCC) 15(023): (2008) |
2006 |
10 | EE | Vikraman Arvind,
Piyush P. Kurur:
A Polynomial Time Nilpotence Test for Galois Groups and Related Results.
MFCS 2006: 134-145 |
9 | EE | Vikraman Arvind,
Piyush P. Kurur:
A Polynomial Time Nilpotence Test for Galois Groups and Related Results
CoRR abs/cs/0605050: (2006) |
8 | EE | Vikraman Arvind,
Piyush P. Kurur:
Graph Isomorphism is in SPP.
Inf. Comput. 204(5): 835-852 (2006) |
2005 |
7 | 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 |
2004 |
6 | EE | Vikraman Arvind,
Piyush P. Kurur:
On the Complexity of Computing Units in a Number Field.
ANTS 2004: 72-86 |
5 | 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) |
2003 |
4 | EE | Vikraman Arvind,
Piyush P. Kurur:
Upper Bounds on the Complexity of Some Galois Theory Problems.
ISAAC 2003: 716-725 |
3 | EE | Vikraman Arvind,
Piyush P. Kurur:
Upper Bounds on the Complexity of some Galois Theory Problems
Electronic Colloquium on Computational Complexity (ECCC)(064): (2003) |
2002 |
2 | EE | Vikraman Arvind,
Piyush P. Kurur:
Graph Isomorphism is in SPP.
FOCS 2002: 743-750 |
1 | EE | Vikraman Arvind,
Piyush P. Kurur:
Graph Isomorphism is in SPP
Electronic Colloquium on Computational Complexity (ECCC)(037): (2002) |