Piyush P. Kurur

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