Vikraman Arvind

266 papers A* 7A 22B 37C 2Misc 8Journal 169Unranked 19
YearRankTypeTitle / Venue / Authors
2026 J jnl
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable.
Algorithmica
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
2025 J jnl
Derandomizing Isolation In Catalytic Logspace.
CoRR
Vikraman Arvind, Srijan Chakraborty, Samir Datta
2025 J jnl
Fast exact algorithms via the Matrix Tree Theorem.
CoRR
Vikraman Arvind, Srijan Chakraborty, Samir Datta, Asif Khan
2025 J jnl
Isomorphism testing of k-spanning tournaments is fixed parameter tractable.
Art Discret. Appl. Math.
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov
2025 J jnl
On Efficient Noncommutative Polynomial Factorization via Higman Linearization.
Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar
2025 J jnl
On a Hierarchy of Spectral Isomorphism Invariants.
Comput. Complex.
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2025 J jnl
On the expressibility of the reconstructional color refinement.
Theor. Comput. Sci.
Vikraman Arvind, Johannes Köbler, Oleg Verbitsky
2025 — conf
Revisiting Tree canonization using polynomials.
SOSA
Vikraman Arvind, Samir Datta, Salman Faris, Asif Khan
2024 A* conf
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results.
ICALP
Vikraman Arvind, Pushkar S. Joglekar
2024 J jnl
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results.
CoRR
Vikraman Arvind, Pushkar S. Joglekar
2024 J jnl
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar
2024 A* conf
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
STOC
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2024 J jnl
Multivariate to bivariate reduction for noncommutative polynomial factorization.
Inf. Comput.
Vikraman Arvind, Pushkar S. Joglekar
2024 A conf
On a Hierarchy of Spectral Invariants for Graphs.
STACS
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2024 J jnl
On the Expressibility of the Reconstructional Color Refinement.
CoRR
Vikraman Arvind, Johannes Köbler, Oleg Verbitsky
2024 J jnl
Revisiting Tree Canonization using polynomials.
CoRR
Vikraman Arvind, Samir Datta, Salman Faris, Asif Khan
2024 — conf
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem.
FSTTCS
Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan
2024 A* conf
Trading Determinism for Noncommutativity in Edmonds' Problem.
FOCS
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2024 J jnl
Trading Determinism for Noncommutativity in Edmonds' Problem.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2024 J jnl
Trading Determinism for Noncommutativity in Edmonds' Problem.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2023 J jnl
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2023 J jnl
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2023 B conf
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization.
MFCS
Vikraman Arvind, Pushkar S. Joglekar
2023 J jnl
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization.
CoRR
Vikraman Arvind, Pushkar S. Joglekar
2023 J jnl
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar
2023 A conf
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field.
ITCS
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
2023 J jnl
On Lifting Lower Bounds for Noncommutative Circuits using Automata.
CoRR
Vikraman Arvind, Abhranil Chatterjee
2023 J jnl
On Lifting Lower Bounds for Noncommutative Circuits using Automata.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee
2023 J jnl
On a Hierarchy of Spectral Isomorphism Invariants.
CoRR
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2023 J jnl
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem.
CoRR
Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan
2022 A conf
Black-Box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial Time.
APPROX/RANDOM
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2022 J jnl
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2022 J jnl
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay
2022 J jnl
CNF Satisfiability in a Subspace and Related Problems.
Algorithmica
Vikraman Arvind, Venkatesan Guruswami
2022 J jnl
Fast Exact Algorithms Using Hadamard Product of Polynomials.
Algorithmica
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2022 J jnl
Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable.
CoRR
Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov
2022 J jnl
Matrix Polynomial Factorization via Higman Linearization.
CoRR
Vikraman Arvind, Pushkar S. Joglekar
2022 J jnl
Matrix Polynomial Factorization via Higman Linearization.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar
2022 A conf
On Efficient Noncommutative Polynomial Factorization via Higman Linearization.
CCC
Vikraman Arvind, Pushkar S. Joglekar
2022 J jnl
On Efficient Noncommutative Polynomial Factorization via Higman Linearization.
CoRR
Vikraman Arvind, Pushkar S. Joglekar
2022 J jnl
On Efficient Noncommutative Polynomial Factorization via Higman Linearization.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar
2022 J jnl
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya
2022 J jnl
On the Weisfeiler-Leman dimension of fractional packing.
Inf. Comput.
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2022 J jnl
Recognizing the Commuting Graph of a Finite Group.
CoRR
Vikraman Arvind, Peter J. Cameron
2022 B conf
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract).
WG
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
2022 J jnl
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.
ACM Trans. Comput. Theory
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
2022 J jnl
Theory research in India: 2019-2022.
Commun. ACM
C. Aiswarya, Vikraman Arvind, Saket Saurabh
2022 J jnl
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
Theory Comput. Syst.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2021 B conf
CNF Satisfiability in a Subspace and Related Problems.
IPEC
Vikraman Arvind, Venkatesan Guruswami
2021 J jnl
CNF Satisfiability in a Subspace and Related Problems.
CoRR
Vikraman Arvind, Venkatesan Guruswami
2021 J jnl
CNF Satisfiability in a Subspace and Related Problems.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Venkatesan Guruswami
2021 B conf
Equivalence Testing of Weighted Automata over Partially Commutative Monoids.
MFCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2021 J jnl
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms.
Algorithmica
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2021 J jnl
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable.
CoRR
Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman
2020 B conf
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem.
MFCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2020 J jnl
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2020 J jnl
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
Chic. J. Theor. Comput. Sci.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2020 J jnl
On Weisfeiler-Leman invariance: Subgraph counts and related graph properties.
J. Comput. Syst. Sci.
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2020 C conf
On the Weisfeiler-Leman Dimension of Fractional Packing.
LATA
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2019 J jnl
Efficient Black-Box Identity Testing for Free Group Algebra.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 — conf
Efficient Black-Box Identity Testing for Free Group Algebras.
APPROX-RANDOM
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 J jnl
Efficient Black-Box Identity Testing over Free Group Algebra.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 — conf
Fast Exact Algorithms Using Hadamard Product of Polynomials.
FSTTCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 B conf
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
ISAAC
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 J jnl
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2019 B conf
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties.
FCT
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2019 J jnl
On the Weisfeiler-Leman Dimension of Fractional Packing.
CoRR
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2019 J jnl
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits.
Theory Comput.
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
2018 J jnl
A Note on Polynomial Identity Testing for Depth-3 Circuits.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 J jnl
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 J jnl
Expanding Generating Sets for Solvable Permutation Groups.
SIAM J. Discret. Math.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2018 J jnl
Fast Exact Algorithms Using Hadamard Product of Polynomials.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 J jnl
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties.
CoRR
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky
2018 J jnl
On the complexity of noncommutative polynomial factorization.
Inf. Comput.
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
2018 J jnl
On the hardness of the noncommutative determinant.
Comput. Complex.
Vikraman Arvind, Srikanth Srinivasan
2018 — conf
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
FSTTCS
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2018 J jnl
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators.
CoRR
Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay
2017 J jnl
A Quest for Structure in Complexity.
Bull. EATCS
Vikraman Arvind, Meena Mahajan
2017 B conf
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings.
MFCS
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
2017 J jnl
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
CoRR
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja
2017 J jnl
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S
2017 B conf
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable.
IPEC
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2017 J jnl
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable.
CoRR
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2017 J jnl
Finding fixed point free elements and small bases in permutation groups.
Theor. Comput. Sci.
Vikraman Arvind
2017 J jnl
Graph Isomorphism, Color Refinement, and Compactness.
Comput. Complex.
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
2017 A conf
Parameterized Complexity of Small Weight Automorphisms.
STACS
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2017 A* conf
Randomized polynomial time identity testing for noncommutative circuits.
STOC
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
2016 J jnl
Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
CoRR
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja
2016 J jnl
Identity Testing for +-Regular Noncommutative Arithmetic Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S
2016 J jnl
Noncommutative Valiant's Classes: Structure and Complete Problems.
ACM Trans. Comput. Theory
Vikraman Arvind, Pushkar S. Joglekar, S. Raja
2016 J jnl
Parameterized Complexity of Small Weight Automorphisms.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2016 J jnl
Randomized Polynomial Time Identity Testing for Noncommutative Circuits.
CoRR
Vikraman Arvind, Partha Mukhopadhyay, S. Raja
2016 J jnl
Randomized Polynomial Time Identity Testing for Noncommutative Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Raja S
2016 J jnl
Solving Linear Equations Parameterized by Hamming Weight.
Algorithmica
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2016 J jnl
Some Lower Bound Results for Set-Multilinear Arithmetic Computations.
Chic. J. Theor. Comput. Sci.
Vikraman Arvind, S. Raja
2016 B conf
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.
MFCS
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
2016 J jnl
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs.
CoRR
Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan
2016 J jnl
The Parameterized Complexity of Geometric Graph Isomorphism.
Algorithmica
Vikraman Arvind, Gaurav Rattan
2016 J jnl
The Weisfeiler-Lehman Procedure.
Bull. EATCS
Vikraman Arvind
2015 J jnl
Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Algorithmica
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
2015 J jnl
Graph Isomorphism, Color Refinement, and Compactness.
CoRR
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
2015 J jnl
Graph Isomorphism, Color Refinement, and Compactness.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
2015 J jnl
Noncommutative Valiant's Classes: Structure and Complete Problems.
CoRR
Vikraman Arvind, Pushkar S. Joglekar, S. Raja
2015 J jnl
Noncommutative Valiant's Classes: Structure and Complete Problems.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar, Raja S
2015 — conf
On Tinhofer's Linear Programming Approach to Isomorphism Testing.
MFCS (2)
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
2015 — conf
On the Complexity of Noncommutative Polynomial Factorization.
MFCS (2)
Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar
2015 J jnl
On the Complexity of Noncommutative Polynomial Factorization.
CoRR
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
2015 J jnl
On the Complexity of Noncommutative Polynomial Factorization.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan
2015 B conf
On the Power of Color Refinement.
FCT
Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky
2015 J jnl
On the isomorphism problem for decision trees and decision lists.
Theor. Comput. Sci.
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
2015 J jnl
Robust Oracle Machines revisited.
Bull. EATCS
Vikraman Arvind
2015 J jnl
Some Lower Bound Results for Set-Multilinear Arithmetic Computations.
CoRR
Vikraman Arvind, S. Raja
2015 J jnl
Some Lower Bound Results for Set-Multilinear Arithmetic Computations.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Raja S
2014 J jnl
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity.
CoRR
Vikraman Arvind, Gaurav Rattan
2014 J jnl
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Gaurav Rattan
2014 J jnl
Isomorphism testing of Boolean functions computable by constant-depth circuits.
Inf. Comput.
Vikraman Arvind, Yadu Vasudev
2014 Misc conf
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains.
CSR
Vikraman Arvind, S. Raja, A. V. Sreejith
2014 B conf
Solving Linear Equations Parameterized by Hamming Weight.
IPEC
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán
2014 J jnl
Solving Linear Equations Parameterized by Hamming Weight.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Jacobo Torán
2014 Misc conf
The Complexity of Bounded Register and Skew Arithmetic Computation.
COCOON
Vikraman Arvind, S. Raja
2014 J jnl
The Complexity of Geometric Graph Isomorphism.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Gaurav Rattan
2014 J jnl
The Complexity of Two Register and Skew Arithmetic Computation.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, S. Raja
2014 B conf
The Parameterized Complexity of Geometric Graph Isomorphism.
IPEC
Vikraman Arvind, Gaurav Rattan
2013 J jnl
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series.
Theory Comput. Syst.
Eric Allender, Vikraman Arvind, Meena Mahajan
2013 B conf
On the Isomorphism Problem for Decision Trees and Decision Lists.
FCT
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev
2013 J jnl
The Alon-Roichman Theorem.
Bull. EATCS
Vikraman Arvind
2013 J jnl
The Parallel Complexity of Graph Canonization Under Abelian Group Action.
Algorithmica
Vikraman Arvind, Johannes Köbler
2013 B conf
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups.
IPEC
Vikraman Arvind
2013 J jnl
The Parameterized Complexity of some Permutation Group Problems
CoRR
Vikraman Arvind
2012 B conf
Approximate Graph Isomorphism.
MFCS
Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev
2012 J jnl
Approximate Graph Isomorphism.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev
2012 B conf
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs.
LATIN
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
2012 C conf
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits.
LATA
Vikraman Arvind, Yadu Vasudev
2012 J jnl
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups
CoRR
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2012 B conf
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.
MFCS
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2012 J jnl
Testing nilpotence of galois groups in polynomial time.
ACM Trans. Algorithms
Vikraman Arvind, Piyush P. Kurur
2012 J jnl
The isomorphism problem for k-trees is complete for logspace.
Inf. Comput.
Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert
2011 Misc conf
Canonizing Hypergraphs under Abelian Group Action.
COCOON
Vikraman Arvind, Johannes Köbler
2011 J jnl
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar
2011 J jnl
Expanding Generator Sets for Solvable Permutation Groups.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev
2011 J jnl
Isomorphism Testing of Boolean Functions Computable by Constant Depth Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Yadu Vasudev
2011 J jnl
Noncommutative Arithmetic Circuits meet Finite Automata.
Bull. EATCS
Vikraman Arvind
2011 J jnl
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP.
ACM Trans. Comput. Theory
Vikraman Arvind, Jacobo Torán
2011 J jnl
The orbit problem is in the GapL hierarchy.
J. Comb. Optim.
Vikraman Arvind, T. C. Vijayaraghavan
2010 A conf
Circuit Lower Bounds, Help Functions, and the Remote Point Problem.
ICS
Vikraman Arvind, Srikanth Srinivasan
2010 J jnl
Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes.
Comput. Complex.
Vikraman Arvind, T. C. Vijayaraghavan
2010 — conf
Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
FSTTCS
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
2010 J jnl
Isomorphism and canonization of tournaments and hypertournaments.
J. Comput. Syst. Sci.
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
2010 J jnl
New Results on Noncommutative and Commutative Polynomial Identity Testing.
Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2010 A* conf
On the hardness of the noncommutative determinant.
STOC
Vikraman Arvind, Srikanth Srinivasan
2010 A conf
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets.
STACS
Vikraman Arvind, Srikanth Srinivasan
2010 J jnl
The ideal membership problem and polynomial identity testing.
Inf. Comput.
Vikraman Arvind, Partha Mukhopadhyay
2010 — conf
Uniform Derandomization from Pathetic Lower Bounds.
APPROX-RANDOM
Eric Allender, Vikraman Arvind, Fengming Wang
2010 J jnl
Uniform Derandomization from Pathetic Lower Bounds.
Electron. Colloquium Comput. Complex.
Eric Allender, Vikraman Arvind, Fengming Wang
2009 J jnl
Arithmetic Circuit Size, Identity Testing, and Finite Automata.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar
2009 J jnl
Arithmetic Circuits and the Hadamard Product of Polynomials
CoRR
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009 — conf
Arithmetic Circuits and the Hadamard Product of Polynomials.
FSTTCS
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009 B conf
Arithmetic Circuits, Monomial Algebras and Finite Automata.
MFCS
Vikraman Arvind, Pushkar S. Joglekar
2009 J jnl
Circuit Lower Bounds, Help Functions, and the Remote Point Problem
CoRR
Vikraman Arvind, Srikanth Srinivasan
2009 J jnl
Circuit Lower Bounds, Help Functions, and the Remote Point Problem.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Srikanth Srinivasan
2009 J jnl
Colored Hypergraph Isomorphism is Fixed Parameter Tractable.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda
2009 J jnl
On Lower Bounds for Constant Width Arithmetic Circuits
CoRR
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009 B conf
On Lower Bounds for Constant Width Arithmetic Circuits.
ISAAC
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009 J jnl
On Lower Bounds for Constant Width Arithmetic Circuits.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan
2009 J jnl
On the Hardness of the Noncommutative Determinant.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Srikanth Srinivasan
2009 J jnl
On the hardness of the noncommutative determinant
CoRR
Vikraman Arvind, Srikanth Srinivasan
2009 J jnl
Parameterized learnability of juntas.
Theor. Comput. Sci.
Vikraman Arvind, Johannes Köbler, Wolfgang Lindner
2009 A conf
Quantum Query Complexity of Multilinear Identity Testing.
STACS
Vikraman Arvind, Partha Mukhopadhyay
2009 J jnl
The Remote Point Problem, Small Bias Space, and Expanding Generator Sets
CoRR
Vikraman Arvind, Srikanth Srinivasan
2009 J jnl
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Srikanth Srinivasan
2008 Misc conf
A Logspace Algorithm for Partial 2-Tree Canonization.
CSR
Vikraman Arvind, Bireswar Das, Johannes Köbler
2008 B conf
Algorithmic Problems for Metrics on Permutation Groups.
SOFSEM
Vikraman Arvind, Pushkar S. Joglekar
2008 J jnl
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
CoRR
Vikraman Arvind, Partha Mukhopadhyay
2008 — conf
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.
APPROX-RANDOM
Vikraman Arvind, Partha Mukhopadhyay
2008 J jnl
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay
2008 J jnl
Lattice Problems, Gauge Functions and Parameterized Algorithms
CoRR
Vikraman Arvind, Pushkar S. Joglekar
2008 A conf
New Results on Noncommutative and Commutative Polynomial Identity Testing.
CCC
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008 J jnl
New results on Noncommutative and Commutative Polynomial Identity Testing
CoRR
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008 J jnl
New results on Noncommutative and Commutative Polynomial Identity Testing.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan
2008 J jnl
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach.
SIAM J. Discret. Math.
Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur
2008 J jnl
Quantum Query Complexity of Multilinear Identity Testing
CoRR
Vikraman Arvind, Partha Mukhopadhyay
2008 J jnl
Quantum Query Complexity of Multilinear Identity Testing.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay
2008 J jnl
SZK Proofs for Black-Box Group Problems.
Theory Comput. Syst.
Vikraman Arvind, Bireswar Das
2008 — conf
Some Sieving Algorithms for Lattice Problems.
FSTTCS
Vikraman Arvind, Pushkar S. Joglekar
2008 Misc conf
The Orbit Problem Is in the GapL Hierarchy.
COCOON
Vikraman Arvind, T. C. Vijayaraghavan
2008 J jnl
The Orbit problem is in the GapL Hierarchy.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, T. C. Vijayaraghavan
2007 — ed.
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings
FSTTCS
Vikraman Arvind, Sanjiva Prasad
2007 J jnl
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach
CoRR
Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur
2007 B conf
Parameterized Learnability of
ALT
Vikraman Arvind, Johannes Köbler, Wolfgang Lindner
2007 J jnl
The Ideal Membership Problem and Polynomial Identity Testing.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Partha Mukhopadhyay
2007 B conf
The Monomial Ideal Membership Problem and Polynomial Identity Testing.
ISAAC
Vikraman Arvind, Partha Mukhopadhyay
2007 B conf
The Space Complexity of
ISAAC
Vikraman Arvind, Bireswar Das, Johannes Köbler
2006 J jnl
A Polynomial Time Nilpotence Test for Galois Groups and Related Results
CoRR
Vikraman Arvind, Piyush P. Kurur
2006 B conf
A Polynomial Time Nilpotence Test for Galois Groups and Related Results.
MFCS
Vikraman Arvind, Piyush P. Kurur
2006 J jnl
Graph Isomorphism is in SPP.
Inf. Comput.
Vikraman Arvind, Piyush P. Kurur
2006 A conf
On Hypergraph and Graph Isomorphism with Bounded Color Classes.
STACS
Vikraman Arvind, Johannes Köbler
2006 B conf
On Isomorphism and Canonization of Tournaments and Hypertournaments.
ISAAC
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
2006 Misc conf
SZK Proofs for Black-Box Group Problems.
CSR
Vikraman Arvind, Bireswar Das
2006 Misc conf
The Complexity of Black-Box Ring Problems.
COCOON
Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
2006 B conf
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem.
ISAAC
Vikraman Arvind, Jacobo Torán
2005 A conf
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
CCC
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
2005 J jnl
Isomorphism Testing: Perspective and Open Problems.
Bull. EATCS
Vikraman Arvind, Jacobo Torán
2005 A conf
The Complexity of Solving Linear Equations over a Finite Ring.
STACS
Vikraman Arvind, T. C. Vijayaraghavan
2004 A conf
Abelian Permutation Group Problems and Logspace Counting Classes.
CCC
Vikraman Arvind, T. C. Vijayaraghavan
2004 J jnl
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
2004 J jnl
Non-stabilizer quantum codes from Abelian subgroups of the error group.
Quantum Inf. Comput.
Vikraman Arvind, Piyush P. Kurur, K. R. Parthasarathy
2004 — conf
On the Complexity of Computing Units in a Number Field.
ANTS
Vikraman Arvind, Piyush P. Kurur
2004 J jnl
Solvable Group Isomorphism is (almost) in NP\cap coNP
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Jacobo Torán
2004 A conf
Solvable Group Isomorphism.
CCC
Vikraman Arvind, Jacobo Torán
2003 J jnl
Arithmetic Complexity, Kleene Closure, and Formal Power Series.
Theory Comput. Syst.
Eric Allender, Vikraman Arvind, Meena Mahajan
2003 B conf
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems.
ISAAC
Vikraman Arvind, Rainer Schuler
2003 B conf
Upper Bounds on the Complexity of Some Galois Theory Problems.
ISAAC
Vikraman Arvind, Piyush P. Kurur
2003 J jnl
Upper Bounds on the Complexity of some Galois Theory Problems
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Piyush P. Kurur
2002 J jnl
Approximate Counting small subgraphs of bounded treewidth and related problems
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Venkatesh Raman
2002 B conf
Approximation Algorithms for Some Parameterized Counting Problems.
ISAAC
Vikraman Arvind, Venkatesh Raman
2002 J jnl
Graph Isomorphism is in SPP
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Piyush P. Kurur
2002 A* conf
Graph Isomorphism is in SPP.
FOCS
Vikraman Arvind, Piyush P. Kurur
2002 J jnl
New Lowness Results for ZPPNP and Other Complexity Classes.
J. Comput. Syst. Sci.
Vikraman Arvind, Johannes Köbler
2002 J jnl
The Query Complexity of Program Checking by Constant-Depth Circuits.
Chic. J. Theor. Comput. Sci.
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
2001 J jnl
A nonadaptive NC checker for permutation group intersection.
Theor. Comput. Sci.
Vikraman Arvind, Jacobo Torán
2001 J jnl
On pseudorandomness and resource-bounded measure.
Theor. Comput. Sci.
Vikraman Arvind, Johannes Köbler
2000 J jnl
Exact learning via teaching assistants.
Theor. Comput. Sci.
Vikraman Arvind, N. V. Vinodchandran
2000 A conf
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results.
STACS
Vikraman Arvind, Johannes Köbler
2000 A conf
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.
STACS
Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
2000 J jnl
The Complexity of Modular Graph Automorphism.
SIAM J. Comput.
Vikraman Arvind, Richard Beigel, Antoni Lozano
2000 J jnl
The counting complexity of group-definable languages.
Theor. Comput. Sci.
Vikraman Arvind, N. V. Vinodchandran
1999 J jnl
Arithmetic Complexity, Kleene Closure, and Formal Power Series
Electron. Colloquium Comput. Complex.
Eric Allender, Vikraman Arvind, Meena Mahajan
1999 J jnl
Graph Isomorphism is Low for ZPP
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Johannes Köbler
1999 A conf
Sparse Sets, Approximable Sets, and Parallel Queries to NP.
STACS
Vikraman Arvind, Jacobo Torán
1999 J jnl
Sparse Sets, Approximable Sets, and Parallel Queries to NP.
Inf. Process. Lett.
Vikraman Arvind, Jacobo Torán
1999 B conf
The Query Complexity of Program Checking by Constant-Depth Circuits.
ISAAC
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
1998 — ed.
Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings
FSTTCS
Vikraman Arvind, Ramaswamy Ramanujam
1998 J jnl
Sparse Sets, Approximable Sets, and Parallel Queries to NP
Electron. Colloquium Comput. Complex.
Vikraman Arvind, Jacobo Torán
1998 A conf
The Complexity of Modular Graph Automorphism.
STACS
Vikraman Arvind, Richard Beigel, Antoni Lozano
1998 J jnl
The Query Complexity of Program Checking by Constant-Depth Circuits
Electron. Colloquium Comput. Complex.
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
1997 A conf
A Nonadaptive NC Checker for Permutation Group Intersection.
CCC
Vikraman Arvind, Jacobo Torán
1997 J jnl
Constructivizing Membership Proofs in Complexity Classes.
Int. J. Found. Comput. Sci.
Vikraman Arvind
1997 B conf
Exact Learning via Teaching Assistants (Extended Abstract).
ALT
Vikraman Arvind, N. V. Vinodchandran
1997 — conf
On Resource-Bounded Measure and Pseudorandomness.
FSTTCS
Vikraman Arvind, Johannes Köbler
1997 J jnl
Solvable Black-Box Group Problems are Low for PP.
Theor. Comput. Sci.
Vikraman Arvind, N. V. Vinodchandran
1996 A conf
A Note on Decision versus Search for Graph Automorphism.
CCC
Manindra Agrawal, Vikraman Arvind
1996 J jnl
A Note on Decision versus Search for Graph Automorphism.
Inf. Comput.
Manindra Agrawal, Vikraman Arvind
1996 Misc conf
A Note on the Self-Witnessing Property of Computational Problems.
COCOON
Vikraman Arvind
1996 J jnl
Geometric Sets of Low Information Content.
Theor. Comput. Sci.
Manindra Agrawal, Vikraman Arvind
1996 J jnl
Monotonous and Randomized Reductions to Sparse Sets.
RAIRO Theor. Informatics Appl.
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1996 J jnl
Quasi-Linear Truth-Table Reductions to p-Selective Sets.
Theor. Comput. Sci.
Manindra Agrawal, Vikraman Arvind
1996 A conf
Solvable Black-Box Group Problems Are Low for PP.
STACS
Vikraman Arvind, N. V. Vinodchandran
1996 B conf
The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract).
ALT
Vikraman Arvind, N. V. Vinodchandran
1996 J jnl
Upper Bounds for the Complexity of Sparse and Tally Descriptions.
Math. Syst. Theory
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1995 J jnl
If NP has Polynomial-Size Circuits, then MA=AM.
Theor. Comput. Sci.
Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
1995 J jnl
On Helping and Interactive Proof Systems.
Int. J. Found. Comput. Sci.
Vikraman Arvind, Johannes Köbler, Rainer Schuler
1995 J jnl
On Reductions to Sets that Avoid EXPSPACE.
Inf. Process. Lett.
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1995 — conf
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets.
SCT
Manindra Agrawal, Vikraman Arvind
1994 B conf
On Helping and Interactive Proof Systems.
ISAAC
Vikraman Arvind, Johannes Köbler, Rainer Schuler
1994 — conf
Polynomial Time Truth-Table Reductions to P-Selective Sets.
SCT
Manindra Agrawal, Vikraman Arvind
1993 B conf
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content.
MFCS
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1992 B conf
Lowness and the Complexity of Sparse and Tally Descriptions.
ISAAC
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1992 — conf
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets.
FSTTCS
Vikraman Arvind, Johannes Köbler, Martin Mundhenk
1992 — conf
Reductions to Sets of Low Information Content.
Complexity Theory: Current Research
Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1992 A* conf
Reductions to Sets of Low Information Content.
ICALP
Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
1991 B conf
A heuristic search strategy for optimization of trade-off cost measures.
ICTAI
Rakesh Kumar Singh, Shashi Kumar, Vikraman Arvind
1991 J jnl
Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties.
Int. J. Found. Comput. Sci.
Vikraman Arvind, Somenath Biswas
1989 J jnl
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas.
Theor. Comput. Sci.
Vikraman Arvind, Somenath Biswas
1987 J jnl
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences.
Inf. Process. Lett.
Vikraman Arvind, Somenath Biswas
1987 A conf
Expressibility of First Order Logic with a Nondeterministic Inductive Operator.
STACS
Vikraman Arvind, Somenath Biswas
1987 — conf
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas.
FSTTCS
Vikraman Arvind, Somenath Biswas