| No. |
Title |
Author |
Year |
| 1 |
On Efficient Noncommutative Polynomial Factorization via Higman Linearization |
Arvind, Vikraman et al. |
2022 |
| 2 |
CNF Satisfiability in a Subspace and Related Problems |
Arvind, Vikraman et al. |
2021 |
| 3 |
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable |
Arvind, Vikraman et al. |
2018 |
| 4 |
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings |
Arvind, Vikraman et al. |
2017 |
| 5 |
Parameterized Complexity of Small Weight Automorphisms |
Arvind, Vikraman et al. |
2017 |
| 6 |
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs |
Arvind, Vikraman et al. |
2016 |
| 7 |
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets |
Arvind, Vikraman et al. |
2010 |
| 8 |
Arithmetic Circuits and the Hadamard Product of Polynomials |
Arvind, Vikraman et al. |
2009 |
| 9 |
Quantum Query Complexity of Multilinear Identity Testing |
Arvind, Vikraman et al. |
2009 |
