Piyush P. Kurur

Publication Activity (10 Years)

Years Active: 2002-2020
Publications (10 Years): 3

Top Topics

Quantum Inspired Evolutionary Algorithm

Greedy Heuristic

Integer Arithmetic

Knapsack Problem

Top Venues

IEEE Trans. Evol. Comput.

ACM Trans. Algorithms

Publications

Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces. IEEE Trans. Evol. Comput. 24 (4) (2020)
Abhishek Dang, Piyush P. Kurur
Verse: An EDSL for Cryptographic Primitives. PPDP (2018)
Satvik Chauhan, Piyush P. Kurur, Brent A. Yorgey
How to twist pointers without breaking them. Haskell (2016)
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
Performance of metropolis algorithm for the minimum weight code word problem. GECCO (2014)
Daniel Johannsen, Piyush P. Kurur, Johannes Lengler
Evolutionary Algorithms for Quantum Computers. Algorithmica 68 (1) (2014)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42 (2) (2013)
Vikraman Arvind, Piyush P. Kurur
Testing nilpotence of galois groups in polynomial time. ACM Trans. Algorithms 8 (3) (2012)
Sagarmoy Dutta, Piyush P. Kurur
+ 1. ISIT (2011)
Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur
Metropolis algorithm for solving shortest lattice vector problem (SVP). HIS (2011)
Daniel Johannsen, Piyush P. Kurur, Johannes Lengler
Can quantum search accelerate evolutionary algorithms? GECCO (2010)
Sagarmoy Dutta, Piyush P. Kurur
Quantum Cyclic Code of length dividing $p^{t}+1$ CoRR (2010)
Sagarmoy Dutta, Piyush P. Kurur
Quantum Cyclic Code CoRR (2010)
Sagarmoy Dutta, Piyush P. Kurur
Representating groups on graphs CoRR (2009)
Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann
Computing single source shortest paths using single-objective fitness. FOGA (2009)
Sagarmoy Dutta, Piyush P. Kurur
Representing Groups on Graphs. MFCS (2009)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast integer multiplication using modular arithmetic. STOC (2008)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast Integer Multiplication using Modular Arithmetic CoRR (2008)
Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi
Fast Integer Multiplication using Modular Arithmetic. Electron. Colloquium Comput. Complex. 15 (023) (2008)
Vikraman Arvind, Piyush P. Kurur
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. MFCS (2006)
Vikraman Arvind, Piyush P. Kurur
A Polynomial Time Nilpotence Test for Galois Groups and Related Results CoRR (2006)
Vikraman Arvind, Piyush P. Kurur
Graph Isomorphism is in SPP. Inf. Comput. 204 (5) (2006)
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. Computational Complexity Conference (2005)
Vikraman Arvind, Piyush P. Kurur, K. R. Parthasarathy
Non-stabilizer quantum codes from Abelian subgroups of the error group. Quantum Inf. Comput. 4 (6) (2004)
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. Electron. Colloquium Comput. Complex. (121) (2004)
Vikraman Arvind, Piyush P. Kurur
On the Complexity of Computing Units in a Number Field. ANTS (2004)
Vikraman Arvind, Piyush P. Kurur
Upper Bounds on the Complexity of some Galois Theory Problems Electron. Colloquium Comput. Complex. (064) (2003)
Vikraman Arvind, Piyush P. Kurur
Upper Bounds on the Complexity of Some Galois Theory Problems. ISAAC (2003)
Vikraman Arvind, Piyush P. Kurur
Graph Isomorphism is in SPP. FOCS (2002)
Vikraman Arvind, Piyush P. Kurur
Graph Isomorphism is in SPP Electron. Colloquium Comput. Complex. (037) (2002)