V. Arvind
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- Computability, Logic, AI Algorithms
- semigroups and automata theory
- Graph Labeling and Dimension Problems
Papers in
-
- Complexity and Algorithms in Graphs 71
- Advanced Graph Theory Research 38
- semigroups and automata theory 30
- Computability, Logic, AI Algorithms 17
-
- Cryptography and Data Security 27
- Machine Learning and Algorithms 18
- Coding theory and cryptography 15
- Co-authors
- Johannes Köbler (34 shared papers)Jacobo Torán (10 shared papers)Venkatesh Raman (1 shared paper)Srikanth Srinivasan (7 shared papers)Oleg Verbitsky (8 shared papers)M. Mundhenk (5 shared papers)Rainer Schuler (3 shared papers)Vinodchandran Variyam (5 shared papers)
- Journals
- Theoretical Computer Science (12 papers)Information and Computation (6 papers)Lecture notes in computer science (38 papers)Theory of Computing Systems (4 papers)Algorithmica (4 papers)
- Partner nations
- IndiaGermanyUnited States
In The Last Decade
V. Arvind
105 papers receiving 744 citations
Peers
Comparison fields: 5 of 55
- Computational Theory and Mathematics 635
- Discrete Mathematics and Combinatorics 54
- Artificial Intelligence 438
- Computational Mathematics 5
- Geometry and Topology 52
Countries citing papers authored by V. Arvind
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).
Fields of papers citing papers by V. Arvind
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-authors
The 25 scholars most cited alongside V. Arvind, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 117 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2002 | 61 | |
| 2 | 2001 | 37 | |
| 3 | 1997 | 33 | |
| 4 | Isomorphism Testing: Perspective and Open Problems. | 2005 | 28 |
| 5 | 2003 | 28 | |
| 6 | 2006 | 27 | |
| 7 | 1992 | 27 | |
| 8 | 2012 | 24 | |
| 9 | 2020 | 21 | |
| 10 | 1992 | 20 | |
| 11 | 2015 | 18 | |
| 12 | 2008 | 18 | |
| 13 | 2010 | 17 | |
| 14 | 2003 | 16 | |
| 15 | 2007 | 15 | |
| 16 | 1996 | 15 | |
| 17 | 2008 | 15 | |
| 18 | 2008 | 14 | |
| 19 | 2010 | 14 | |
| 20 | 2008 | 14 |
About V. Arvind
V. Arvind is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Discrete Mathematics and Combinatorics, Algebra and Number Theory and Geometry and Topology, having authored 117 papers that have together received 805 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (71 papers), Advanced Graph Theory Research (38 papers), semigroups and automata theory (30 papers), Cryptography and Data Security (27 papers), Machine Learning and Algorithms (18 papers), Computability, Logic, AI Algorithms (17 papers), Coding theory and cryptography (15 papers) and graph theory and CDMA systems (11 papers). The work is most often cited by research in Computational Theory and Mathematics (635 citations), Discrete Mathematics and Combinatorics (54 citations), Artificial Intelligence (438 citations), Computational Mathematics (5 citations) and Geometry and Topology (52 citations). V. Arvind has collaborated with scholars based in India, Germany and United States. Frequent co-authors include Johannes Köbler, Jacobo Torán, Venkatesh Raman, Srikanth Srinivasan, Oleg Verbitsky, M. Mundhenk, Rainer Schuler, Vinodchandran Variyam, Gaurav Rattan and K. R. Parthasarathy. Their work appears in journals such as Theoretical Computer Science, Information and Computation, Lecture notes in computer science, Theory of Computing Systems and Algorithmica.
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.