default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPiyush P. Kurur
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c15]Amrutha Benny
, Sandeep Chandran, Rajshekar Kalayappan, Ramchandra Phawade, Piyush P. Kurur:
faRM-LTL: A Domain-Specific Architecture for Flexible and Accelerated Runtime Monitoring of LTL Properties. RV 2024: 109-127- 2020
- [j6]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): 664-678 (2020)
2010 – 2019
- 2018
- [c14]Abhishek Dang, Piyush P. Kurur:
Verse: An EDSL for Cryptographic Primitives. PPDP 2018: 10:1-10:9 - 2016
- [c13]Satvik Chauhan, Piyush P. Kurur, Brent A. Yorgey:
How to twist pointers without breaking them. Haskell 2016: 51-61 - 2014
- [j5]Daniel Johannsen, Piyush P. Kurur, Johannes Lengler:
Evolutionary Algorithms for Quantum Computers. Algorithmica 68(1): 152-189 (2014) - [c12]Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur:
Performance of metropolis algorithm for the minimum weight code word problem. GECCO 2014: 485-492 - 2013
- [j4]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication Using Modular Arithmetic. SIAM J. Comput. 42(2): 685-699 (2013) - 2012
- [j3]Vikraman Arvind, Piyush P. Kurur:
Testing nilpotence of galois groups in polynomial time. ACM Trans. Algorithms 8(3): 32:1-32:22 (2012) - 2011
- [c11]Ajitha Shenoy K. B, Somenath Biswas, Piyush P. Kurur:
Metropolis algorithm for solving shortest lattice vector problem (SVP). HIS 2011: 442-447 - [c10]Sagarmoy Dutta, Piyush P. Kurur:
Quantum cyclic code of length dividing pt + 1. ISIT 2011: 648-652 - 2010
- [c9]Daniel Johannsen, Piyush P. Kurur, Johannes Lengler:
Can quantum search accelerate evolutionary algorithms? GECCO 2010: 1433-1440 - [i9]Sagarmoy Dutta, Piyush P. Kurur:
Quantum Cyclic Code. CoRR abs/1007.1697 (2010) - [i8]Sagarmoy Dutta, Piyush P. Kurur:
Quantum Cyclic Code of length dividing $p^{t}+1$. CoRR abs/1011.5814 (2010)
2000 – 2009
- 2009
- [c8]Surender Baswana, Somenath Biswas, Benjamin Doerr, Tobias Friedrich, Piyush P. Kurur, Frank Neumann:
Computing single source shortest paths using single-objective fitness. FOGA 2009: 59-66 - [c7]Sagarmoy Dutta, Piyush P. Kurur:
Representing Groups on Graphs. MFCS 2009: 295-306 - [i7]Sagarmoy Dutta, Piyush P. Kurur:
Representating groups on graphs. CoRR abs/0904.3941 (2009) - 2008
- [c6]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast integer multiplication using modular arithmetic. STOC 2008: 499-506 - [i6]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. CoRR abs/0801.1416 (2008) - [i5]Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi:
Fast Integer Multiplication using Modular Arithmetic. Electron. Colloquium Comput. Complex. TR08 (2008) - 2006
- [j2]Vikraman Arvind, Piyush P. Kurur:
Graph Isomorphism is in SPP. Inf. Comput. 204(5): 835-852 (2006) - [c5]Vikraman Arvind, Piyush P. Kurur:
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. MFCS 2006: 134-145 - [i4]Vikraman Arvind, Piyush P. Kurur:
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. CoRR abs/cs/0605050 (2006) - 2005
- [c4]Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan:
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. CCC 2005: 13-27 - 2004
- [j1]Vikraman Arvind, Piyush P. Kurur, K. R. Parthasarathy:
Non-stabilizer quantum codes from Abelian subgroups of the error group. Quantum Inf. Comput. 4(6): 411-436 (2004) - [c3]Vikraman Arvind, Piyush P. Kurur:
On the Complexity of Computing Units in a Number Field. ANTS 2004: 72-86 - [i3]Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan:
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [c2]Vikraman Arvind, Piyush P. Kurur:
Upper Bounds on the Complexity of Some Galois Theory Problems. ISAAC 2003: 716-725 - [i2]Vikraman Arvind, Piyush P. Kurur:
Upper Bounds on the Complexity of some Galois Theory Problems. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [c1]Vikraman Arvind, Piyush P. Kurur:
Graph Isomorphism is in SPP. FOCS 2002: 743-750 - [i1]Vikraman Arvind, Piyush P. Kurur:
Graph Isomorphism is in SPP. Electron. Colloquium Comput. Complex. TR02 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-02 22:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
