Piyush P. Kurur

According to our database, Piyush P. Kurur authored at least 22 papers between 2002 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

faRM-LTL: A Domain-Specific Architecture for Flexible and Accelerated Runtime Monitoring of LTL Properties.

Amrutha Benny, Sandeep Chandran, Rajshekar Kalayappan, Ramchandra Phawade, Piyush P. Kurur

Proceedings of the Runtime Verification - 24th International Conference, 2024

2020

Efficacy of the Metropolis Algorithm for the Minimum-Weight Codeword Problem Using Codeword and Generator Search Spaces.

Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur

IEEE Trans. Evol. Comput., 2020

2018

Verse: An EDSL for Cryptographic Primitives.

Abhishek Dang, Piyush P. Kurur

Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018

2016

How to twist pointers without breaking them.

Satvik Chauhan, Piyush P. Kurur, Brent A. Yorgey

Proceedings of the 9th International Symposium on Haskell, 2016

2014

Evolutionary Algorithms for Quantum Computers.

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Algorithmica, 2014

Performance of metropolis algorithm for the minimum weight code word problem.

Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur

Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2012

Testing nilpotence of galois groups in polynomial time.

Vikraman Arvind, Piyush P. Kurur

ACM Trans. Algorithms, 2012

2011

Quantum cyclic code of length dividing p^t + 1.

Sagarmoy Dutta, Piyush P. Kurur

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Metropolis algorithm for solving shortest lattice vector problem (SVP).

Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur

Proceedings of the 11th International Conference on Hybrid Intelligent Systems, 2011

2010

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

Sagarmoy Dutta, Piyush P. Kurur

CoRR, 2010

Quantum Cyclic Code

Sagarmoy Dutta, Piyush P. Kurur

CoRR, 2010

Can quantum search accelerate evolutionary algorithms?

Daniel Johannsen, Piyush P. Kurur, Johannes Lengler

Proceedings of the Genetic and Evolutionary Computation Conference, 2010

2009

Representating groups on graphs

Sagarmoy Dutta, Piyush P. Kurur

CoRR, 2009

Representing Groups on Graphs.

Sagarmoy Dutta, Piyush P. Kurur

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Computing single source shortest paths using single-objective fitness.

Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann

Proceedings of the Foundations of Genetic Algorithms, 2009

2008

Fast integer multiplication using modular arithmetic.

Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi

Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2008

2006

A Polynomial Time Nilpotence Test for Galois Groups and Related Results.

Vikraman Arvind, Piyush P. Kurur

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

2005

Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.

Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Non-stabilizer quantum codes from Abelian subgroups of the error group.

Vikraman Arvind, Piyush P. Kurur, K. R. Parthasarathy

Quantum Inf. Comput., 2004

On the Complexity of Computing Units in a Number Field.

Vikraman Arvind, Piyush P. Kurur

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

Upper Bounds on the Complexity of Some Galois Theory Problems.

Vikraman Arvind, Piyush P. Kurur

Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

2002

Graph Isomorphism is in SPP.

Vikraman Arvind, Piyush P. Kurur

Proceedings of the 43rd Symposium on Foundations of Computer Science, 2002