Vikraman Arvind

ORCID

Publication Activity (10 Years)

Years Active: 1987-2024
Publications (10 Years): 86

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

Algorithmica

MFCS

Publications

Vikraman Arvind, Pushkar S. Joglekar
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. Electron. Colloquium Comput. Complex. (2024)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Trading Determinism for Noncommutativity in Edmonds' Problem. Electron. Colloquium Comput. Complex. (2024)
Vikraman Arvind, Pushkar S. Joglekar
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. ICALP (2024)
Vikraman Arvind, Pushkar S. Joglekar
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. CoRR (2024)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. STOC (2024)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On a Hierarchy of Spectral Invariants for Graphs. STACS (2024)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Trading Determinism for Noncommutativity in Edmonds' Problem. CoRR (2024)
Vikraman Arvind, Johannes Köbler, Oleg Verbitsky
On the Expressibility of the Reconstructional Color Refinement. CoRR (2024)
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. ITCS (2023)
Vikraman Arvind, Pushkar S. Joglekar
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. (2023)
Vikraman Arvind, Pushkar S. Joglekar
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee
On Lifting Lower Bounds for Noncommutative Circuits using Automata. Electron. Colloquium Comput. Complex. (2023)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On a Hierarchy of Spectral Isomorphism Invariants. CoRR (2023)
Vikraman Arvind, Pushkar S. Joglekar
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. MFCS (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. Electron. Colloquium Comput. Complex. (2023)
Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. CoRR (2023)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time. APPROX/RANDOM (2022)
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). WG (2022)
Vikraman Arvind, Pushkar S. Joglekar
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. CCC (2022)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. Electron. Colloquium Comput. Complex. (2022)
C. Aiswarya, Vikraman Arvind, Saket Saurabh
Theory research in India: 2019-2022. Commun. ACM 65 (11) (2022)
Vikraman Arvind, Peter. J. Cameron
Recognizing the Commuting Graph of a Finite Group. CoRR (2022)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Theory Comput. Syst. 66 (1) (2022)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. Algorithmica 84 (2) (2022)
Vikraman Arvind, Pushkar S. Joglekar
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. 29 (2022)
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. CoRR (2022)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On the Weisfeiler-Leman dimension of fractional packing. Inf. Comput. 288 (2022)
Vikraman Arvind, Pushkar S. Joglekar
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. CoRR (2022)
Vikraman Arvind, Pushkar S. Joglekar
Matrix Polynomial Factorization via Higman Linearization. CoRR (2022)
Vikraman Arvind, Venkatesan Guruswami
CNF Satisfiability in a Subspace and Related Problems. Algorithmica 84 (11) (2022)
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. CoRR (2022)
Vikraman Arvind, Pushkar S. Joglekar
Matrix Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. (2022)
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov
Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable. CoRR (2022)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. ACM Trans. Comput. Theory 14 (2) (2022)
Vikraman Arvind, Venkatesan Guruswami
CNF Satisfiability in a Subspace and Related Problems. CoRR (2021)
Vikraman Arvind, Venkatesan Guruswami
CNF Satisfiability in a Subspace and Related Problems. Electron. Colloquium Comput. Complex. 28 (2021)
Vikraman Arvind, Venkatesan Guruswami
CNF Satisfiability in a Subspace and Related Problems. IPEC (2021)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. Algorithmica 83 (12) (2021)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Equivalence Testing of Weighted Automata over Partially Commutative Monoids. MFCS (2021)
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR (2021)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. CoRR (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. MFCS (2020)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On the Weisfeiler-Leman Dimension of Fractional Packing. LATA (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. Chic. J. Theor. Comput. Sci. 2020 (2020)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties. J. Comput. Syst. Sci. 113 (2020)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. CoRR (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. ISAAC (2019)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. FCT (2019)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. Theory Comput. 15 (2019)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On the Weisfeiler-Leman Dimension of Fractional Packing. CoRR (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing over Free Group Algebra. CoRR (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing for Free Group Algebra. Electron. Colloquium Comput. Complex. 26 (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. FSTTCS (2019)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Efficient Black-Box Identity Testing for Free Group Algebras. APPROX-RANDOM (2019)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. CoRR (2018)
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
Expanding Generating Sets for Solvable Permutation Groups. SIAM J. Discret. Math. 32 (3) (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Fast Exact Algorithms Using Hadamard Product of Polynomials. CoRR (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. Electron. Colloquium Comput. Complex. 25 (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
A Note on Polynomial Identity Testing for Depth-3 Circuits. CoRR (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. FSTTCS (2018)
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. CoRR (2018)
Vikraman Arvind, Srikanth Srinivasan
On the hardness of the noncommutative determinant. Comput. Complex. 27 (1) (2018)
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
On the complexity of noncommutative polynomial factorization. Inf. Comput. 262 (2018)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. MFCS (2017)
Vikraman Arvind, Meena Mahajan
A Quest for Structure in Complexity. Bull. EATCS 123 (2017)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
Graph Isomorphism, Color Refinement, and Compactness. Comput. Complex. 26 (3) (2017)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. CoRR (2017)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. IPEC (2017)
Vikraman Arvind
Finding fixed point free elements and small bases in permutation groups. Theor. Comput. Sci. 687 (2017)
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. Electron. Colloquium Comput. Complex. 24 (2017)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. CoRR (2017)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms. STACS (2017)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
Randomized polynomial time identity testing for noncommutative circuits. STOC (2017)
Vikraman Arvind, Partha Mukhopadhyay, S. Raja
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. CoRR (2016)
Vikraman Arvind, Pushkar S. Joglekar, S. Raja
Noncommutative Valiant's Classes: Structure and Complete Problems. ACM Trans. Comput. Theory 9 (1) (2016)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Parameterized Complexity of Small Weight Automorphisms. Electron. Colloquium Comput. Complex. 23 (2016)
Vikraman Arvind, S. Raja
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Chic. J. Theor. Comput. Sci. 2016 (2016)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. MFCS (2016)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
Solving Linear Equations Parameterized by Hamming Weight. Algorithmica 75 (2) (2016)
Vikraman Arvind
The Weisfeiler-Lehman Procedure. Bull. EATCS 120 (2016)
Vikraman Arvind, Gaurav Rattan
The Parameterized Complexity of Geometric Graph Isomorphism. Algorithmica 75 (2) (2016)
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. CoRR (2016)
Vikraman Arvind, Partha Mukhopadhyay, Raja S
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. Electron. Colloquium Comput. Complex. 23 (2016)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. CoRR (2016)
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. 23 (2016)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
Graph Isomorphism, Color Refinement, and Compactness. Electron. Colloquium Comput. Complex. 22 (2015)
Vikraman Arvind
Robust Oracle Machines revisited. Bull. EATCS 115 (2015)
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
On the Complexity of Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. 22 (2015)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
Graph Isomorphism, Color Refinement, and Compactness. CoRR (2015)
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
On the isomorphism problem for decision trees and decision lists. Theor. Comput. Sci. 590 (2015)
Vikraman Arvind, S. Raja
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. CoRR (2015)
Vikraman Arvind, Raja S
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Electron. Colloquium Comput. Complex. 22 (2015)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
On the Power of Color Refinement. FCT (2015)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
On Tinhofer's Linear Programming Approach to Isomorphism Testing. MFCS (2) (2015)
Vikraman Arvind, Pushkar S. Joglekar, S. Raja
Noncommutative Valiant's Classes: Structure and Complete Problems. CoRR (2015)
Vikraman Arvind, Pushkar S. Joglekar, Raja S
Noncommutative Valiant's Classes: Structure and Complete Problems. Electron. Colloquium Comput. Complex. 22 (2015)
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71 (1) (2015)
Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar
On the Complexity of Noncommutative Polynomial Factorization. MFCS (2) (2015)
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
On the Complexity of Noncommutative Polynomial Factorization. CoRR (2015)

Vikraman Arvind.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Vikraman Arvind