Piyush P. Kurur

According to our database1, Piyush P. Kurur authored at least 21 papers between 2002 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces.
IEEE Trans. Evol. Comput., 2020

2018
Verse: An EDSL for Cryptographic Primitives.
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2016
How to twist pointers without breaking them.
Proceedings of the 9th International Symposium on Haskell, 2016

2014
Evolutionary Algorithms for Quantum Computers.
Algorithmica, 2014

Performance of metropolis algorithm for the minimum weight code word problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2012
Testing nilpotence of galois groups in polynomial time.
ACM Trans. Algorithms, 2012

2011
Quantum cyclic code of length dividing p<sup>t</sup> + 1.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Metropolis algorithm for solving shortest lattice vector problem (SVP).
Proceedings of the 11th International Conference on Hybrid Intelligent Systems, 2011

2010
Quantum Cyclic Code of length dividing $p^{t}+1$
CoRR, 2010

Quantum Cyclic Code
CoRR, 2010

Can quantum search accelerate evolutionary algorithms?
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009
Representating groups on graphs
CoRR, 2009

Representing Groups on Graphs.
Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Computing single source shortest paths using single-objective fitness.
Proceedings of the Foundations of Genetic Algorithms, 2009

2008
Fast Integer Multiplication using Modular Arithmetic.
Electron. Colloquium Comput. Complex., 2008

2006
A Polynomial Time Nilpotence Test for Galois Groups and Related Results.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2004
Non-stabilizer quantum codes from Abelian subgroups of the error group.
Quantum Inf. Comput., 2004

Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
Electron. Colloquium Comput. Complex., 2004

On the Complexity of Computing Units in a Number Field.
Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003
Upper Bounds on the Complexity of some Galois Theory Problems
Electron. Colloquium Comput. Complex., 2003

2002
Graph Isomorphism is in SPP
Electron. Colloquium Comput. Complex., 2002


  Loading...