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

Piyush P. Kurur

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

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

Coauthor Index

1Vikraman Arvind [1] [2] [3] [4] [5] [6] [7] [8] [9] [10]
2Anindya De [11] [12] [13]
3Sagarmoy Dutta [14]
4Chandan Saha [11] [12] [13]
5Ramprasad Saptharishi [11] [12] [13]
6T. C. Vijayaraghavan [5] [7]

Colors in the list of coauthors

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