Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVikraman Arvind
Person information
- affiliation: Institute of Mathematical Sciences, Chennai, India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[c89]Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. ITCS 2023: 6:1-6:23- [c88]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. MFCS 2023: 14:1-14:15 - [i86]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. CoRR abs/2303.06001 (2023) - [i85]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 abs/2308.10073 (2023) - [i84]Vikraman Arvind, Abhranil Chatterjee:
On Lifting Lower Bounds for Noncommutative Circuits using Automata. Electron. Colloquium Comput. Complex. TR23 (2023) - [i83]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [j65]Vikraman Arvind
, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. Algorithmica 84(2): 436-463 (2022) - [j64]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. Algorithmica 84(11): 3276-3299 (2022) - [j63]C. Aiswarya, Vikraman Arvind, Saket Saurabh:
Theory research in India: 2019-2022. Commun. ACM 65(11): 88-93 (2022) - [j62]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On the Weisfeiler-Leman dimension of fractional packing. Inf. Comput. 288: 104803 (2022) - [j61]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. Theory Comput. Syst. 66(1): 56-88 (2022) - [j60]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): 9:1-9:26 (2022) - [c87]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: 23:1-23:22 - [c86]Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. CCC 2022: 12:1-12:22 - [c85]Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing Isomorphism of Chordal Graphs of Bounded Leafage is Fixed-Parameter Tractable (Extended Abstract). WG 2022: 29-42 - [i82]Vikraman Arvind, Ilia Ponomarenko, Grigory Ryabov:
Isomorphism testing of k-spanning tournaments is Fixed Parameter Tractable. CoRR abs/2201.12312 (2022) - [i81]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-box Identity Testing of Noncommutative Rational Formulas of Inversion Height Two in Deterministic Quasipolynomial-time. CoRR abs/2202.05693 (2022) - [i80]Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. CoRR abs/2202.09883 (2022) - [i79]Vikraman Arvind, Pushkar S. Joglekar:
Matrix Polynomial Factorization via Higman Linearization. CoRR abs/2203.16978 (2022) - [i78]Vikraman Arvind, Peter J. Cameron:
Recognizing the Commuting Graph of a Finite Group. CoRR abs/2206.01059 (2022) - [i77]Vikraman Arvind, Abhranil Chatterjee, Utsab Ghosal, Partha Mukhopadhyay, C. Ramya:
On Identity Testing and Noncommutative Rank Computation over the Free Skew Field. CoRR abs/2209.04797 (2022) - [i76]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. TR22 (2022) - [i75]Vikraman Arvind, Pushkar S. Joglekar:
On Efficient Noncommutative Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. TR22 (2022) - [i74]Vikraman Arvind, Pushkar S. Joglekar:
Matrix Polynomial Factorization via Higman Linearization. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j59]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Parameterized Complexity of Small Weight Automorphisms and Isomorphisms. Algorithmica 83(12): 3567-3601 (2021) - [c84]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. IPEC 2021: 5:1-5:15 - [c83]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Equivalence Testing of Weighted Automata over Partially Commutative Monoids. MFCS 2021: 10:1-10:15 - [i73]Vikraman Arvind, Roman Nedela, Ilia Ponomarenko, Peter Zeman:
Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable. CoRR abs/2107.10689 (2021) - [i72]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. CoRR abs/2108.05914 (2021) - [i71]Vikraman Arvind, Venkatesan Guruswami:
CNF Satisfiability in a Subspace and Related Problems. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [j58]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) - [j57]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: 42-59 (2020) - [c82]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On the Weisfeiler-Leman Dimension of Fractional Packing. LATA 2020: 357-368 - [c81]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
A Special Case of Rational Identity Testing and the Brešar-Klep Theorem. MFCS 2020: 10:1-10:14 - [i70]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids. CoRR abs/2002.08633 (2020)
2010 – 2019
- 2019
- [j56]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial-Time Identity Testing for Noncommutative Circuits. Theory Comput. 15: 1-36 (2019) - [c80]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing for Free Group Algebras. APPROX-RANDOM 2019: 57:1-57:16 - [c79]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. FCT 2019: 111-125 - [c78]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. FSTTCS 2019: 9:1-9:14 - [c77]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. ISAAC 2019: 38:1-38:13 - [i69]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing over Free Group Algebra. CoRR abs/1904.12337 (2019) - [i68]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
On Explicit Branching Programs for the Rectangular Determinant and Permanent Polynomials. CoRR abs/1908.08347 (2019) - [i67]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On the Weisfeiler-Leman Dimension of Fractional Packing. CoRR abs/1910.11325 (2019) - [i66]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Efficient Black-Box Identity Testing for Free Group Algebra. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j55]Vikraman Arvind, Srikanth Srinivasan:
On the hardness of the noncommutative determinant. Comput. Complex. 27(1): 1-29 (2018) - [j54]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the complexity of noncommutative polynomial factorization. Inf. Comput. 262: 22-39 (2018) - [j53]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generating Sets for Solvable Permutation Groups. SIAM J. Discret. Math. 32(3): 1721-1740 (2018) - [c76]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. FSTTCS 2018: 7:1-7:18 - [i65]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
A Note on Polynomial Identity Testing for Depth-3 Circuits. CoRR abs/1805.06692 (2018) - [i64]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Fast Exact Algorithms Using Hadamard Product of Polynomials. CoRR abs/1807.04496 (2018) - [i63]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Univariate Ideal Membership Parameterized by Rank, Degree, and Number of Generators. CoRR abs/1808.10787 (2018) - [i62]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On Weisfeiler-Leman Invariance: Subgraph Counts and Related Graph Properties. CoRR abs/1811.04801 (2018) - [i61]Vikraman Arvind, Abhranil Chatterjee, Rajit Datta, Partha Mukhopadhyay:
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j52]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. Comput. Complex. 26(3): 627-685 (2017) - [j51]Vikraman Arvind, Meena Mahajan:
A Quest for Structure in Complexity. Bull. EATCS 123 (2017) - [j50]Vikraman Arvind:
Finding fixed point free elements and small bases in permutation groups. Theor. Comput. Sci. 687: 70-78 (2017) - [c75]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. IPEC 2017: 2:1-2:13 - [c74]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja:
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings. MFCS 2017: 38:1-38:13 - [c73]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Parameterized Complexity of Small Weight Automorphisms. STACS 2017: 7:1-7:13 - [c72]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Randomized polynomial time identity testing for noncommutative circuits. STOC 2017: 831-841 - [i60]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, S. Raja:
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. CoRR abs/1705.00140 (2017) - [i59]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable. CoRR abs/1709.10063 (2017) - [i58]Vikraman Arvind, Rajit Datta, Partha Mukhopadhyay, Raja S:
Efficient Identity Testing and Polynomial Factorization over Non-associative Free Rings. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [j49]Vikraman Arvind, Gaurav Rattan:
The Parameterized Complexity of Geometric Graph Isomorphism. Algorithmica 75(2): 258-276 (2016) - [j48]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Solving Linear Equations Parameterized by Hamming Weight. Algorithmica 75(2): 322-338 (2016) - [j47]Vikraman Arvind, S. Raja:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Chic. J. Theor. Comput. Sci. 2016 (2016) - [j46]Vikraman Arvind:
The Weisfeiler-Lehman Procedure. Bull. EATCS 120 (2016) - [j45]Vikraman Arvind, Pushkar S. Joglekar, S. Raja:
Noncommutative Valiant's Classes: Structure and Complete Problems. ACM Trans. Comput. Theory 9(1): 3:1-3:29 (2016) - [c71]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: 13:1-13:14 - [i57]Vikraman Arvind, Partha Mukhopadhyay, S. Raja:
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. CoRR abs/1606.00596 (2016) - [i56]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan:
The Parameterized Complexity of Fixing Number and Vertex Individualization in Graphs. CoRR abs/1606.04383 (2016) - [i55]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, S. Raja:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. CoRR abs/1611.07235 (2016) - [i54]Vikraman Arvind, Pushkar S. Joglekar, Partha Mukhopadhyay, Raja S:
Identity Testing for +-Regular Noncommutative Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - [i53]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Parameterized Complexity of Small Weight Automorphisms. Electron. Colloquium Comput. Complex. TR16 (2016) - [i52]Vikraman Arvind, Partha Mukhopadhyay, Raja S:
Randomized Polynomial Time Identity Testing for Noncommutative Circuits. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j44]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Algorithmica 71(1): 120-138 (2015) - [j43]Vikraman Arvind:
Robust Oracle Machines revisited. Bull. EATCS 115 (2015) - [j42]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: 38-54 (2015) - [c70]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
On the Power of Color Refinement. FCT 2015: 339-350 - [c69]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
On Tinhofer's Linear Programming Approach to Isomorphism Testing. MFCS (2) 2015: 26-37 - [c68]Vikraman Arvind, Gaurav Rattan, Pushkar S. Joglekar:
On the Complexity of Noncommutative Polynomial Factorization. MFCS (2) 2015: 38-49 - [i51]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the Complexity of Noncommutative Polynomial Factorization. CoRR abs/1501.00671 (2015) - [i50]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. CoRR abs/1502.01255 (2015) - [i49]Vikraman Arvind, Pushkar S. Joglekar, S. Raja:
Noncommutative Valiant's Classes: Structure and Complete Problems. CoRR abs/1508.00395 (2015) - [i48]Vikraman Arvind, S. Raja:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. CoRR abs/1511.02308 (2015) - [i47]Vikraman Arvind, Pushkar S. Joglekar, Gaurav Rattan:
On the Complexity of Noncommutative Polynomial Factorization. Electron. Colloquium Comput. Complex. TR15 (2015) - [i46]Vikraman Arvind, Pushkar S. Joglekar, Raja S:
Noncommutative Valiant's Classes: Structure and Complete Problems. Electron. Colloquium Comput. Complex. TR15 (2015) - [i45]Vikraman Arvind, Johannes Köbler, Gaurav Rattan, Oleg Verbitsky:
Graph Isomorphism, Color Refinement, and Compactness. Electron. Colloquium Comput. Complex. TR15 (2015) - [i44]Vikraman Arvind, Raja S:
Some Lower Bound Results for Set-Multilinear Arithmetic Computations. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [j41]Vikraman Arvind, Yadu Vasudev:
Isomorphism testing of Boolean functions computable by constant-depth circuits. Inf. Comput. 239: 3-12 (2014) - [c67]Vikraman Arvind, S. Raja:
The Complexity of Bounded Register and Skew Arithmetic Computation. COCOON 2014: 572-583 - [c66]Vikraman Arvind, S. Raja, A. V. Sreejith:
On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains. CSR 2014: 65-76 - [c65]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Jacobo Torán:
Solving Linear Equations Parameterized by Hamming Weight. IPEC 2014: 39-50 - [c64]Vikraman Arvind, Gaurav Rattan:
The Parameterized Complexity of Geometric Graph Isomorphism. IPEC 2014: 51-62 - [i43]Vikraman Arvind, Gaurav Rattan:
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. CoRR abs/1408.3510 (2014) - [i42]Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Jacobo Torán:
Solving Linear Equations Parameterized by Hamming Weight. Electron. Colloquium Comput. Complex. TR14 (2014) - [i41]Vikraman Arvind, S. Raja:
The Complexity of Two Register and Skew Arithmetic Computation. Electron. Colloquium Comput. Complex. TR14 (2014) - [i40]Vikraman Arvind, Gaurav Rattan:
The Complexity of Geometric Graph Isomorphism. Electron. Colloquium Comput. Complex. TR14 (2014) - [i39]Vikraman Arvind, Gaurav Rattan:
Faster FPT Algorithm for Graph Isomorphism Parameterized by Eigenvalue Multiplicity. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j40]Vikraman Arvind, Johannes Köbler:
The Parallel Complexity of Graph Canonization Under Abelian Group Action. Algorithmica 67(2): 247-276 (2013) - [j39]Vikraman Arvind:
The Alon-Roichman Theorem. Bull. EATCS 111 (2013) - [j38]Eric Allender, Vikraman Arvind, Meena Mahajan:
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 53(3): 503-506 (2013) - [c63]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Gaurav Rattan, Yadu Vasudev:
On the Isomorphism Problem for Decision Trees and Decision Lists. FCT 2013: 16-27 - [c62]Vikraman Arvind:
The Parameterized Complexity of Fixpoint Free Elements and Bases in Permutation Groups. IPEC 2013: 4-15 - [i38]Vikraman Arvind:
The Parameterized Complexity of some Permutation Group Problems. CoRR abs/1301.0379 (2013) - 2012
- [j37]Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert:
The isomorphism problem for k-trees is complete for logspace. Inf. Comput. 217: 1-11 (2012) - [j36]Vikraman Arvind, Piyush P. Kurur:
Testing nilpotence of galois groups in polynomial time. ACM Trans. Algorithms 8(3): 32:1-32:22 (2012) - [c61]Vikraman Arvind, Yadu Vasudev:
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. LATA 2012: 83-94 - [c60]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. LATIN 2012: 37-48 - [c59]Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev:
Approximate Graph Isomorphism. MFCS 2012: 100-111 - [c58]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generator Sets for Solvable Permutation Groups. MFCS 2012: 112-123 - [i37]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups. CoRR abs/1201.3181 (2012) - [i36]Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev:
Approximate Graph Isomorphism. Electron. Colloquium Comput. Complex. TR12 (2012) - 2011
- [j35]Vikraman Arvind:
Noncommutative Arithmetic Circuits meet Finite Automata. Bull. EATCS 104: 45-66 (2011) - [j34]Vikraman Arvind, T. C. Vijayaraghavan:
The orbit problem is in the GapL hierarchy. J. Comb. Optim. 21(1): 124-137 (2011) - [j33]Vikraman Arvind, Jacobo Torán:
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP. ACM Trans. Comput. Theory 2(2): 4:1-4:22 (2011) - [c57]Vikraman Arvind, Johannes Köbler:
Canonizing Hypergraphs under Abelian Group Action. COCOON 2011: 444-455 - [i35]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar:
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. Electron. Colloquium Comput. Complex. TR11 (2011) - [i34]Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev:
Expanding Generator Sets for Solvable Permutation Groups. Electron. Colloquium Comput. Complex. TR11 (2011) - [i33]Vikraman Arvind, Yadu Vasudev:
Isomorphism Testing of Boolean Functions Computable by Constant Depth Circuits. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [j32]Vikraman Arvind, T. C. Vijayaraghavan:
Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes. Comput. Complex. 19(1): 57-98 (2010) - [j31]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New Results on Noncommutative and Commutative Polynomial Identity Testing. Comput. Complex. 19(4): 521-558 (2010) - [j30]