Piyush P. Kurur

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	2012
j3		Vikraman Arvind, Piyush P. Kurur: Testing nilpotence of galois groups in polynomial time. ACM Transactions on Algorithms 8(3): 32 (2012)
	2011
c11		Shenoy K. B. Ajitha, Somenath Biswas, Piyush P. Kurur: Metropolis algorithm for solving shortest lattice vector problem (SVP). HIS 2011: 442-447
c10		Sagarmoy Dutta, Piyush P. Kurur: Quantum cyclic code of length dividing p^t + 1. ISIT 2011: 648-652
	2010
c9		Daniel Johannsen, Piyush P. Kurur, Johannes Lengler: Can quantum search accelerate evolutionary algorithms? GECCO 2010: 1433-1440
i9		Sagarmoy Dutta, Piyush P. Kurur: Quantum Cyclic Code. CoRR abs/1007.1697 (2010)
i8		Sagarmoy Dutta, Piyush P. Kurur: Quantum Cyclic Code of length dividing $p^{t}+1$. CoRR abs/1011.5814 (2010)
	2009
c8		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
c7		Sagarmoy Dutta, Piyush P. Kurur: Representing Groups on Graphs. MFCS 2009: 295-306
i7		Sagarmoy Dutta, Piyush P. Kurur: Representating groups on graphs. CoRR abs/0904.3941 (2009)
	2008
c6		Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast integer multiplication using modular arithmetic. STOC 2008: 499-506
i6		Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi: Fast Integer Multiplication using Modular Arithmetic. CoRR abs/0801.1416 (2008)
i5		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
j2		Vikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP. Inf. Comput. 204(5): 835-852 (2006)
c5		Vikraman Arvind, Piyush P. Kurur: A Polynomial Time Nilpotence Test for Galois Groups and Related Results. MFCS 2006: 134-145
i4		Vikraman Arvind, Piyush P. Kurur: A Polynomial Time Nilpotence Test for Galois Groups and Related Results. CoRR abs/cs/0605050 (2006)
	2005
c4		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
j1		Vikraman Arvind, Piyush P. Kurur, K. R. Parthasarathy: Non-stabilizer quantum codes from abelian subggroups of the error group. Quantum Information & Computation 4(6): 411-436 (2004)
c3		Vikraman Arvind, Piyush P. Kurur: On the Complexity of Computing Units in a Number Field. ANTS 2004: 72-86
i3		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
c2		Vikraman Arvind, Piyush P. Kurur: Upper Bounds on the Complexity of Some Galois Theory Problems. ISAAC 2003: 716-725
i2		Vikraman Arvind, Piyush P. Kurur: Upper Bounds on the Complexity of some Galois Theory Problems. Electronic Colloquium on Computational Complexity (ECCC)(064) (2003)
	2002
c1		Vikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP. FOCS 2002: 743-750
i1		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	[c11]
2	Vikraman Arvind	[j3] [j2] [c5] [i4] [c4] [j1] [c3] [i3] [c2] [i2] [c1] [i1]
3	Surender Baswana	[c8]
4	Somenath Biswas	[c11] [c8]
5	Anindya De	[c6] [i6] [i5]
6	Benjamin Doerr	[c8]
7	Sagarmoy Dutta	[c10] [i9] [i8] [c7] [i7]
8	Tobias Friedrich	[c8]
9	Daniel Johannsen	[c9]
10	Johannes Lengler	[c9]
11	Frank Neumann	[c8]
12	K. R. Parthasarathy	[j1]
13	Chandan Saha	[c6] [i6] [i5]
14	Ramprasad Saptharishi	[c6] [i6] [i5]
15	T. C. Vijayaraghavan	[c4] [i3]

Colors in the list of coauthors

Last update Wed May 22 22:02:04 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page