Piyush P. Kurur

	2011
21		Shenoy K. B. Ajitha, Somenath Biswas, Piyush P. Kurur: Metropolis algorithm for solving shortest lattice vector problem (SVP). HIS 2011: 442-447
20		Sagarmoy Dutta, Piyush P. Kurur: Quantum cyclic code of length dividing pt + 1. ISIT 2011: 648-652
	2010
19		Daniel Johannsen, Piyush P. Kurur, Johannes Lengler: Can quantum search accelerate evolutionary algorithms? GECCO 2010: 1433-1440
18		Sagarmoy Dutta, Piyush P. Kurur: Quantum Cyclic Code CoRR abs/1007.1697: (2010)
17		Sagarmoy Dutta, Piyush P. Kurur: Quantum Cyclic Code of length dividing $p^{t}+1$ CoRR abs/1011.5814: (2010)
	2009
16		Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann: Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66
15		Sagarmoy Dutta, Piyush P. Kurur: Representing Groups on Graphs. MFCS 2009: 295-306
14		Sagarmoy Dutta, Piyush P. Kurur: Representating groups on graphs CoRR abs/0904.3941: (2009)
	2008
13		Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast integer multiplication using modular arithmetic. STOC 2008: 499-506
12		Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast Integer Multiplication using Modular Arithmetic CoRR abs/0801.1416: (2008)
11		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		Vikraman Arvind, Piyush P. Kurur: A Polynomial Time Nilpotence Test for Galois Groups and Related Results. MFCS 2006: 134-145
9		Vikraman Arvind, Piyush P. Kurur: A Polynomial Time Nilpotence Test for Galois Groups and Related Results CoRR abs/cs/0605050: (2006)
8		Vikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP. Inf. Comput. 204(5): 835-852 (2006)
	2005
7		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		Vikraman Arvind, Piyush P. Kurur: On the Complexity of Computing Units in a Number Field. ANTS 2004: 72-86
5		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		Vikraman Arvind, Piyush P. Kurur: Upper Bounds on the Complexity of Some Galois Theory Problems. ISAAC 2003: 716-725
3		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		Vikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP. FOCS 2002: 743-750
1		Vikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP Electronic Colloquium on Computational Complexity (ECCC)(037): (2002)

Coauthor Index

1	Shenoy K. B. Ajitha	[21]
2	Vikraman Arvind	[1] [2] [3] [4] [5] [6] [7] [8] [9] [10]
3	Surender Baswana	[16]
4	Somenath Biswas	[16] [21]
5	Anindya De	[11] [12] [13]
6	Benjamin Doerr	[16]
7	Sagarmoy Dutta	[14] [15] [17] [18] [20]
8	Tobias Friedrich	[16]
9	Daniel Johannsen	[19]
10	Johannes Lengler	[19]
11	Frank Neumann	[16]
12	Chandan Saha	[11] [12] [13]
13	Ramprasad Saptharishi	[11] [12] [13]
14	T. C. Vijayaraghavan	[5] [7]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page