| 2024 | RV | 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 |
| 2018 | PPDP | Verse: An EDSL for Cryptographic Primitives. | Abhishek Dang, Piyush P. Kurur |
| 2016 | HASKELL | How to twist pointers without breaking them. | Satvik Chauhan, Piyush P. Kurur, Brent A. Yorgey |
| 2014 | GECCO | Performance of metropolis algorithm for the minimum weight code word problem. | Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur |
| 2011 | HIS | Metropolis algorithm for solving shortest lattice vector problem (SVP). | Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur |
| 2011 | ISIT | Quantum cyclic code of length dividing p | Sagarmoy Dutta, Piyush P. Kurur |
| 2010 | GECCO | Can quantum search accelerate evolutionary algorithms? | Daniel Johannsen, Piyush P. Kurur, Johannes Lengler |
| 2009 | FOGA | Computing single source shortest paths using single-objective fitness. | Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann |
| 2009 | MFCS | Representing Groups on Graphs. | Sagarmoy Dutta, Piyush P. Kurur |
| 2008 | STOC | Fast integer multiplication using modular arithmetic. | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi |
| 2006 | MFCS | A Polynomial Time Nilpotence Test for Galois Groups and Related Results. | Vikraman Arvind, Piyush P. Kurur |
| 2003 | ISAAC | Upper Bounds on the Complexity of Some Galois Theory Problems. | Vikraman Arvind, Piyush P. Kurur |
| 2002 | FOCS | Graph Isomorphism is in SPP. | Vikraman Arvind, Piyush P. Kurur |