Vikraman Arvind

Graph Learning · 2002–2015

A researcher in the Science corpus: 2 papers; trusts 3 researchers and is trusted by 1 researcher here, as inferred from the citation graph.

Subfields

• Graph Learning — 5 citations into it

Whom Vikraman Arvind trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. László Babai
2. Eugene M. Luks
3. Uwe Schöning
4. Leslie G. Valiant

Who trusts Vikraman Arvind overall

1. Christopher Morris
2. B. Douglas
3. Andreas Loukas
4. Sandra Kiefer

Papers from Vikraman Arvind's perspective

Ordered by how strongly the researchers Vikraman Arvind trusts endorse each paper. Same corpus, a different order for every researcher.

1. The Complexity of Computing the Permanent
2. Graph Isomorphism is in the Low Hierarchy
3. Canonical labeling of graphs
4. A Note on the Graph Isomorphism counting Problem
5. Random Graph Isomorphism
6. Learning logical definitions from relations
7. A theory of the learnable
8. An optimal lower bound on the number of variables for graph identification
9. Matrix multiplication via arithmetic progressions
10. The Magma Algebra System I: The User Language

Their papers

• On the Power of Color Refinement (2015) — 48 citations
• Graph isomorphism is in SPP (2002) — 100 citations