Piyush P. Kurur
2002
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 1 researcher here, as inferred from the citation graph.
Whom Piyush P. Kurur trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Piyush P. Kurur overall
Papers from Piyush P. Kurur's perspective
Ordered by how strongly the researchers Piyush P. Kurur trusts endorse each paper. Same corpus, a different order for every researcher.
- The Complexity of Computing the Permanent
- Graph Isomorphism is in the Low Hierarchy
- A Note on the Graph Isomorphism counting Problem
- Canonical labeling of graphs
- Random Graph Isomorphism
- Matrix multiplication via arithmetic progressions
- The Magma Algebra System I: The User Language
- The NP-Completeness Column: An Ongoing Guide
- The complexity of theorem-proving procedures
- A logical calculus of the ideas immanent in nervous activity
Their papers
- Graph isomorphism is in SPP (2002) — 100 citations