This map shows the geographic impact of V. Arvind's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by V. Arvind with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites V. Arvind more than expected).
This network shows the impact of papers produced by V. Arvind. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by V. Arvind. The network helps show where V. Arvind may publish in the future.
Co-authorship network of co-authors of V. Arvind
This figure shows the co-authorship network connecting the top 25 collaborators of V. Arvind.
A scholar is included among the top collaborators of V. Arvind based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with V. Arvind. V. Arvind is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Arvind, V., et al.. (2019). . Theory of Computing. 15(1). 1–36.6 indexed citations
2.
Arvind, V. & Meena Mahajan. (2017). A Quest for Structure in Complexity. Bulletin of the European Association for Theoretical Computer Science. 3(123).1 indexed citations
Arvind, V., et al.. (2015). Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Electronic colloquium on computational complexity. 2016. 176.1 indexed citations
6.
Arvind, V., et al.. (2014). The Complexity of Geometric Graph Isomorphism.. Electronic colloquium on computational complexity. 21. 70.2 indexed citations
7.
Arvind, V., et al.. (2014). The Complexity of Two Register and Skew Arithmetic Computation.. Electronic colloquium on computational complexity. 21. 28.
Arvind, V., et al.. (2009). Arithmetic Circuit Size, Identity Testing, and Finite Automata. Electronic colloquium on computational complexity. 16. 26.2 indexed citations
10.
Arvind, V. & Johannes Kobler. (2008). On Hypergraph and Graph Isomorphism with Bounded Color Classes ⋆.
11.
Arvind, V., et al.. (2007). The Ideal Membership Problem and Polynomial Identity Testing.. Electronic colloquium on computational complexity. 14.1 indexed citations
Arvind, V. & Jacobo Torán. (2005). Isomorphism Testing: Perspective and Open Problems.. Bulletin of the European Association for Theoretical Computer Science. 86. 66–84.21 indexed citations
Arvind, V. & Jacobo Torán. (2004). Solvable Group Isomorphism is (almost) in NP\cap coNP. Electronic colloquium on computational complexity.1 indexed citations
Arvind, V., et al.. (2002). Graph Isomorphism is in SPP. Electronic colloquium on computational complexity.
19.
Arvind, V. & Venkatesh Raman. (2002). Approximate Counting small subgraphs of bounded treewidth and related problems. Electronic colloquium on computational complexity.3 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.