V. Arvind

Chennai Mathematical Institute — India

Computer Science · Physical Sciences

20h-index1.3kcitations232works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Complexity and Algorithms in Graphs(123), Advanced Graph Theory Research(74), semigroups and automata theory(58), Cryptography and Data Security(49), Machine Learning and Algorithms(38)

Publications232 total

Derandomizing Isolation In Catalytic Logspace
arXiv (Cornell University)·2025Open Access
On a Hierarchy of Spectral Isomorphism Invariants
Computational Complexity·2025Open Access
On the expressibility of the reconstructional color refinement
Theoretical Computer Science·2025Open Access
Revisiting Tree canonization using polynomials
Society for Industrial and Applied Mathematics eBooks·2025
Isomorphism testing of k-spanning tournaments is fixed parameter tractable
The Art of Discrete and Applied Mathematics·2024Open Access
Trading Determinism for Noncommutativity in Edmonds' Problem
2024
Revisiting Tree Canonization using polynomials
arXiv (Cornell University)·2024Open Access
On the Expressibility of the Reconstructional Color Refinement
arXiv (Cornell University)·2024Open Access
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time
2024Open Access
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results
arXiv (Cornell University)·2024Open Access
On a Hierarchy of Spectral Invariants for Graphs
arXiv (Cornell University)·2023Open Access
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem
arXiv (Cornell University)·2023Open Access
On Lifting Lower Bounds for Noncommutative Circuits using Automata
arXiv (Cornell University)·2023Open Access
Theory research in India
Communications of the ACM·2022Open Access
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs
ACM Transactions on Computation Theory·2022Open Access
CNF Satisfiability in a Subspace and Related Problems
Algorithmica·2022· 1 citedOpen Access
Black-box Identity Testing of Noncommutative Rational Formulas of\n Inversion Height Two in Deterministic Quasipolynomial-time
arXiv (Cornell University)·2022Open Access
Isomorphism testing of $k$-spanning tournaments is Fixed Parameter Tractable
arXiv (Cornell University)·2022Open Access
Fast Exact Algorithms Using Hadamard Product of Polynomials
Algorithmica·2022· 5 cited
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract)
Lecture notes in computer science·2022· 6 cited
page 1 of 12Next →

Frequent Co-authors

Johannes Köbler(17), Partha Mukhopadhyay(7), Jacobo Torán(5), Oleg Verbitsky(4), Srikanth Srinivasan(4), M. Agrawal(4), Bireswar Das(4), Piyush P. Kurur(3), M. Mundhenk(3), Pushkar S. Joglekar(3), Rainer Schuler(3), Frank Fuhlbrück(2), Uwe Schöning(2), Sebastian Kuhnert(2), Gaurav Rattan(2), K. R. Parthasarathy(2), Venkatesh Raman(1), Yenjo Han(1), Lane A. Hemachandra(1), Antoni Lozano(1)