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
- 2024
[j66]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to bivariate reduction for noncommutative polynomial factorization. Inf. Comput. 301: 105223 (2024)- [c94]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. FOCS 2024: 539-559 - [c93]Vikraman Arvind, Samir Datta, Asif Khan, Shivdutt Sharma, Yadu Vasudev, Shankar Ram Vasudevan:
The Parallel Dynamic Complexity of the Abelian Cayley Group Membership Problem. FSTTCS 2024: 4:1-4:23 - [c92]Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. ICALP 2024: 14:1-14:19 - [c91]Vikraman Arvind, Frank Fuhlbrück
, Johannes Köbler, Oleg Verbitsky:
On a Hierarchy of Spectral Invariants for Graphs. STACS 2024: 6:1-6:18 - [c90]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. STOC 2024: 106-117 - [i96]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. CoRR abs/2404.07986 (2024) - [i95]Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. CoRR abs/2404.16382 (2024) - [i94]Vikraman Arvind, Johannes Köbler, Oleg Verbitsky:
On the Expressibility of the Reconstructional Color Refinement. CoRR abs/2406.09351 (2024) - [i93]Vikraman Arvind, Samir Datta, Salman Faris, Asif Khan:
Revisiting Tree Canonization using polynomials. CoRR abs/2408.10338 (2024) - [i92]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Trading Determinism for Noncommutativity in Edmonds' Problem. Electron. Colloquium Comput. Complex. TR24 (2024) - [i91]Vikraman Arvind, Pushkar S. Joglekar:
A Multivariate to Bivariate Reduction for Noncommutative Rank and Related Results. Electron. Colloquium Comput. Complex. TR24 (2024) - 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 - [i90]Vikraman Arvind, Pushkar S. Joglekar:
Multivariate to Bivariate Reduction for Noncommutative Polynomial Factorization. CoRR abs/2303.06001 (2023) - [i89]Vikraman Arvind, Abhranil Chatterjee:
On Lifting Lower Bounds for Noncommutative Circuits using Automata. CoRR abs/2308.04854 (2023) - [i88]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) - [i87]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. CoRR abs/2309.15647 (2023) - [i86]Vikraman Arvind, Frank Fuhlbrück, Johannes Köbler, Oleg Verbitsky:
On a Hierarchy of Spectral Isomorphism Invariants. CoRR abs/2310.04391 (2023) - [i85]Vikraman Arvind, Abhranil Chatterjee:
On Lifting Lower Bounds for Noncommutative Circuits using Automata. Electron. Colloquium Comput. Complex. TR23 (2023) - [i84]Vikraman Arvind, Abhranil Chatterjee, Partha Mukhopadhyay:
Black-Box Identity Testing of Noncommutative Rational Formulas in Deterministic Quasipolynomial Time. 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]Vikraman Arvind, Partha Mukhopadhyay:
The ideal membership problem and polynomial identity testing. Inf. Comput. 208(4): 351-363 (2010) - [j29]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
Isomorphism and canonization of tournaments and hypertournaments. J. Comput. Syst. Sci. 76(7): 509-523 (2010) - [c56]Eric Allender, Vikraman Arvind, Fengming Wang:
Uniform Derandomization from Pathetic Lower Bounds. APPROX-RANDOM 2010: 380-393 - [c55]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. FSTTCS 2010: 327-337 - [c54]Vikraman Arvind, Srikanth Srinivasan:
Circuit Lower Bounds, Help Functions, and the Remote Point Problem. ICS 2010: 383-396 - [c53]Vikraman Arvind, Srikanth Srinivasan:
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. STACS 2010: 59-70 - [c52]Vikraman Arvind, Srikanth Srinivasan:
On the hardness of the noncommutative determinant. STOC 2010: 677-686 - [i32]Eric Allender, Vikraman Arvind, Fengming Wang:
Uniform Derandomization from Pathetic Lower Bounds. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j28]Vikraman Arvind, Johannes Köbler, Wolfgang Lindner:
Parameterized learnability of juntas. Theor. Comput. Sci. 410(47-49): 4928-4936 (2009) - [c51]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
Arithmetic Circuits and the Hadamard Product of Polynomials. FSTTCS 2009: 25-36 - [c50]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
On Lower Bounds for Constant Width Arithmetic Circuits. ISAAC 2009: 637-646 - [c49]Vikraman Arvind, Pushkar S. Joglekar:
Arithmetic Circuits, Monomial Algebras and Finite Automata. MFCS 2009: 78-89 - [c48]Vikraman Arvind, Partha Mukhopadhyay:
Quantum Query Complexity of Multilinear Identity Testing. STACS 2009: 87-98 - [i31]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
On Lower Bounds for Constant Width Arithmetic Circuits. CoRR abs/0907.3780 (2009) - [i30]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
Arithmetic Circuits and the Hadamard Product of Polynomials. CoRR abs/0907.4006 (2009) - [i29]Vikraman Arvind, Srikanth Srinivasan:
The Remote Point Problem, Small Bias Space, and Expanding Generator Sets. CoRR abs/0909.5313 (2009) - [i28]Vikraman Arvind, Srikanth Srinivasan:
On the hardness of the noncommutative determinant. CoRR abs/0910.2370 (2009) - [i27]Vikraman Arvind, Srikanth Srinivasan:
Circuit Lower Bounds, Help Functions, and the Remote Point Problem. CoRR abs/0911.4337 (2009) - [i26]Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda:
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. Electron. Colloquium Comput. Complex. TR09 (2009) - [i25]Vikraman Arvind, Pushkar S. Joglekar:
Arithmetic Circuit Size, Identity Testing, and Finite Automata. Electron. Colloquium Comput. Complex. TR09 (2009) - [i24]Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan:
On Lower Bounds for Constant Width Arithmetic Circuits. Electron. Colloquium Comput. Complex. TR09 (2009) - [i23]Vikraman Arvind, Srikanth Srinivasan:
On the Hardness of the Noncommutative Determinant. Electron. Colloquium Comput. Complex. TR09 (2009) - [i22]Vikraman Arvind, Srikanth Srinivasan:
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. Electron. Colloquium Comput. Complex. TR09 (2009) - [i21]Vikraman Arvind, Srikanth Srinivasan:
Circuit Lower Bounds, Help Functions, and the Remote Point Problem. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [j27]Vikraman Arvind, Bireswar Das:
SZK Proofs for Black-Box Group Problems. Theory Comput. Syst. 43(2): 100-117 (2008) - [j26]Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur:
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. SIAM J. Discret. Math. 22(4): 1297-1324 (2008) - [c47]Vikraman Arvind, Partha Mukhopadhyay:
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. APPROX-RANDOM 2008: 276-289 - [c46]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New Results on Noncommutative and Commutative Polynomial Identity Testing. CCC 2008: 268-279 - [c45]Vikraman Arvind, T. C. Vijayaraghavan:
The Orbit Problem Is in the GapL Hierarchy. COCOON 2008: 160-169 - [c44]Vikraman Arvind, Bireswar Das, Johannes Köbler:
A Logspace Algorithm for Partial 2-Tree Canonization. CSR 2008: 40-51 - [c43]Vikraman Arvind, Pushkar S. Joglekar:
Some Sieving Algorithms for Lattice Problems. FSTTCS 2008: 25-36 - [c42]Vikraman Arvind, Pushkar S. Joglekar:
Algorithmic Problems for Metrics on Permutation Groups. SOFSEM 2008: 136-147 - [i20]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New results on Noncommutative and Commutative Polynomial Identity Testing. CoRR abs/0801.0514 (2008) - [i19]Vikraman Arvind, Partha Mukhopadhyay:
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. CoRR abs/0804.0957 (2008) - [i18]Vikraman Arvind, Pushkar S. Joglekar:
Lattice Problems, Gauge Functions and Parameterized Algorithms. CoRR abs/0804.4744 (2008) - [i17]Vikraman Arvind, Partha Mukhopadhyay:
Quantum Query Complexity of Multilinear Identity Testing. CoRR abs/0807.1412 (2008) - [i16]Vikraman Arvind, Partha Mukhopadhyay:
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. Electron. Colloquium Comput. Complex. TR08 (2008) - [i15]Vikraman Arvind, Partha Mukhopadhyay:
Quantum Query Complexity of Multilinear Identity Testing. Electron. Colloquium Comput. Complex. TR08 (2008) - [i14]Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan:
New results on Noncommutative and Commutative Polynomial Identity Testing. Electron. Colloquium Comput. Complex. TR08 (2008) - [i13]Vikraman Arvind, T. C. Vijayaraghavan:
The Orbit problem is in the GapL Hierarchy. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c41]Vikraman Arvind, Johannes Köbler, Wolfgang Lindner:
Parameterized Learnability of k -Juntas and Related Problems. ALT 2007: 120-134 - [c40]Vikraman Arvind, Partha Mukhopadhyay:
The Monomial Ideal Membership Problem and Polynomial Identity Testing. ISAAC 2007: 800-811 - [c39]Vikraman Arvind, Bireswar Das, Johannes Köbler:
The Space Complexity of k -Tree Isomorphism. ISAAC 2007: 822-833 - [e2]Vikraman Arvind, Sanjiva Prasad:
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings. Lecture Notes in Computer Science 4855, Springer 2007, ISBN 978-3-540-77049-7 [contents] - [i12]Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur:
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach. CoRR abs/math/0703927 (2007) - [i11]Vikraman Arvind, Partha Mukhopadhyay:
The Ideal Membership Problem and Polynomial Identity Testing. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [j25]Vikraman Arvind, Piyush P. Kurur:
Graph Isomorphism is in SPP. Inf. Comput. 204(5): 835-852 (2006) - [c38]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
The Complexity of Black-Box Ring Problems. COCOON 2006: 126-135 - [c37]Vikraman Arvind, Bireswar Das:
SZK Proofs for Black-Box Group Problems. CSR 2006: 6-17 - [c36]Vikraman Arvind, Jacobo Torán:
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. ISAAC 2006: 233-242 - [c35]Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay:
On Isomorphism and Canonization of Tournaments and Hypertournaments. ISAAC 2006: 449-459 - [c34]Vikraman Arvind, Piyush P. Kurur:
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. MFCS 2006: 134-145 - [c33]Vikraman Arvind, Johannes Köbler:
On Hypergraph and Graph Isomorphism with Bounded Color Classes. STACS 2006: 384-395 - [i10]Vikraman Arvind, Piyush P. Kurur:
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. CoRR abs/cs/0605050 (2006) - 2005
- [j24]Vikraman Arvind, Jacobo Torán:
Isomorphism Testing: Perspective and Open Problems. Bull. EATCS 86: 66-84 (2005) - [c32]Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan:
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. CCC 2005: 13-27 - [c31]Vikraman Arvind, T. C. Vijayaraghavan:
The Complexity of Solving Linear Equations over a Finite Ring. STACS 2005: 472-484 - 2004
- [j23]Vikraman Arvind, Piyush P. Kurur, K. R. Parthasarathy:
Non-stabilizer quantum codes from Abelian subgroups of the error group. Quantum Inf. Comput. 4(6): 411-436 (2004) - [c30]Vikraman Arvind, Piyush P. Kurur:
On the Complexity of Computing Units in a Number Field. ANTS 2004: 72-86 - [c29]Vikraman Arvind, Jacobo Torán:
Solvable Group Isomorphism. CCC 2004: 91-103 - [c28]Vikraman Arvind, T. C. Vijayaraghavan:
Abelian Permutation Group Problems and Logspace Counting Classes. CCC 2004: 204-214 - [i9]Vikraman Arvind, Jacobo Torán:
Solvable Group Isomorphism is (almost) in NP\cap coNP. Electron. Colloquium Comput. Complex. TR04 (2004) - [i8]Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan:
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j22]Eric Allender, Vikraman Arvind, Meena Mahajan:
Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 36(4): 303-328 (2003) - [c27]Vikraman Arvind, Rainer Schuler:
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. ISAAC 2003: 168-177 - [c26]Vikraman Arvind, Piyush P. Kurur:
Upper Bounds on the Complexity of Some Galois Theory Problems. ISAAC 2003: 716-725 - [i7]Vikraman Arvind, Piyush P. Kurur:
Upper Bounds on the Complexity of some Galois Theory Problems. Electron. Colloquium Comput. Complex. TR03 (2003) - 2002
- [j21]Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. Chic. J. Theor. Comput. Sci. 2002 (2002) - [j20]Vikraman Arvind, Johannes Köbler:
New Lowness Results for ZPPNP and Other Complexity Classes. J. Comput. Syst. Sci. 65(2): 257-277 (2002) - [c25]Vikraman Arvind, Piyush P. Kurur:
Graph Isomorphism is in SPP. FOCS 2002: 743-750 - [c24]Vikraman Arvind, Venkatesh Raman:
Approximation Algorithms for Some Parameterized Counting Problems. ISAAC 2002: 453-464 - [i6]Vikraman Arvind, Venkatesh Raman:
Approximate Counting small subgraphs of bounded treewidth and related problems. Electron. Colloquium Comput. Complex. TR02 (2002) - [i5]Vikraman Arvind, Piyush P. Kurur:
Graph Isomorphism is in SPP. Electron. Colloquium Comput. Complex. TR02 (2002) - 2001
- [j19]Vikraman Arvind, Johannes Köbler:
On pseudorandomness and resource-bounded measure. Theor. Comput. Sci. 255(1-2): 205-221 (2001) - [j18]Vikraman Arvind, Jacobo Torán:
A nonadaptive NC checker for permutation group intersection. Theor. Comput. Sci. 259(1-2): 597-611 (2001) - 2000
- [j17]Vikraman Arvind, Richard Beigel, Antoni Lozano:
The Complexity of Modular Graph Automorphism. SIAM J. Comput. 30(4): 1299-1320 (2000) - [j16]Vikraman Arvind, N. V. Vinodchandran:
Exact learning via teaching assistants. Theor. Comput. Sci. 241(1-2): 51-81 (2000) - [j15]Vikraman Arvind, N. V. Vinodchandran:
The counting complexity of group-definable languages. Theor. Comput. Sci. 242(1-2): 199-218 (2000) - [c23]Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán:
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323 - [c22]Vikraman Arvind, Johannes Köbler:
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. STACS 2000: 431-442
1990 – 1999
- 1999
- [j14]Vikraman Arvind, Jacobo Torán:
Sparse Sets, Approximable Sets, and Parallel Queries to NP. Inf. Process. Lett. 69(4): 181-188 (1999) - [c21]Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132 - [c20]Vikraman Arvind, Jacobo Torán:
Sparse Sets, Approximable Sets, and Parallel Queries to NP. STACS 1999: 281-290 - [i4]Eric Allender, Vikraman Arvind, Meena Mahajan:
Arithmetic Complexity, Kleene Closure, and Formal Power Series. Electron. Colloquium Comput. Complex. TR99 (1999) - [i3]Vikraman Arvind, Johannes Köbler:
Graph Isomorphism is Low for ZPPNP and other Lowness results. Electron. Colloquium Comput. Complex. TR99 (1999) - 1998
- [c19]Vikraman Arvind, Richard Beigel, Antoni Lozano:
The Complexity of Modular Graph Automorphism. STACS 1998: 172-182 - [e1]Vikraman Arvind, Ramaswamy Ramanujam:
Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings. Lecture Notes in Computer Science 1530, Springer 1998, ISBN 3-540-65384-8 [contents] - [i2]Vikraman Arvind, Jacobo Torán:
Sparse Sets, Approximable Sets, and Parallel Queries to NP. Electron. Colloquium Comput. Complex. TR98 (1998) - [i1]Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. Electron. Colloquium Comput. Complex. TR98 (1998) - 1997
- [j13]Vikraman Arvind:
Constructivizing Membership Proofs in Complexity Classes. Int. J. Found. Comput. Sci. 8(4): 433-442 (1997) - [j12]Vikraman Arvind, N. V. Vinodchandran:
Solvable Black-Box Group Problems are Low for PP. Theor. Comput. Sci. 180(1-2): 17-45 (1997) - [c18]Vikraman Arvind, N. V. Vinodchandran:
Exact Learning via Teaching Assistants (Extended Abstract). ALT 1997: 291-306 - [c17]Vikraman Arvind, Jacobo Torán:
A Nonadaptive NC Checker for Permutation Group Intersection. CCC 1997: 204-212 - [c16]Vikraman Arvind, Johannes Köbler:
On Resource-Bounded Measure and Pseudorandomness. FSTTCS 1997: 235-249 - 1996
- [j11]Manindra Agrawal, Vikraman Arvind:
A Note on Decision versus Search for Graph Automorphism. Inf. Comput. 131(2): 179-189 (1996) - [j10]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Monotonous and Randomized Reductions to Sparse Sets. RAIRO Theor. Informatics Appl. 30(2): 155-179 (1996) - [j9]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Upper Bounds for the Complexity of Sparse and Tally Descriptions. Math. Syst. Theory 29(1): 63-94 (1996) - [j8]Manindra Agrawal, Vikraman Arvind:
Geometric Sets of Low Information Content. Theor. Comput. Sci. 158(1&2): 193-219 (1996) - [j7]Manindra Agrawal, Vikraman Arvind:
Quasi-Linear Truth-Table Reductions to p-Selective Sets. Theor. Comput. Sci. 158(1&2): 361-370 (1996) - [c15]Vikraman Arvind, N. V. Vinodchandran:
The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). ALT 1996: 100-112 - [c14]Manindra Agrawal, Vikraman Arvind:
A Note on Decision versus Search for Graph Automorphism. CCC 1996: 272-277 - [c13]Vikraman Arvind:
A Note on the Self-Witnessing Property of Computational Problems. COCOON 1996: 241-249 - [c12]Vikraman Arvind, N. V. Vinodchandran:
Solvable Black-Box Group Problems Are Low for PP. STACS 1996: 99-110 - 1995
- [j6]Vikraman Arvind, Johannes Köbler, Rainer Schuler:
On Helping and Interactive Proof Systems. Int. J. Found. Comput. Sci. 6(2): 137-153 (1995) - [j5]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56(2): 109-114 (1995) - [j4]Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler:
If NP has Polynomial-Size Circuits, then MA=AM. Theor. Comput. Sci. 137(2): 279-282 (1995) - [c11]Manindra Agrawal, Vikraman Arvind:
Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. SCT 1995: 264-276 - 1994
- [c10]Manindra Agrawal, Vikraman Arvind:
Polynomial Time Truth-Table Reductions to P-Selective Sets. SCT 1994: 24-30 - [c9]Vikraman Arvind, Johannes Köbler, Rainer Schuler:
On Helping and Interactive Proof Systems. ISAAC 1994: 137-145 - 1993
- [c8]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241 - 1992
- [c7]Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf:
Reductions to Sets of Low Information Content. Complexity Theory: Current Research 1992: 1-46 - [c6]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS 1992: 140-151 - [c5]Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf:
Reductions to Sets of Low Information Content. ICALP 1992: 162-173 - [c4]Vikraman Arvind, Johannes Köbler, Martin Mundhenk:
Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC 1992: 249-258 - 1991
- [j3]Vikraman Arvind, Somenath Biswas:
Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. Int. J. Found. Comput. Sci. 2(2): 83-99 (1991) - [c3]Rakesh Kumar Singh, Shashi Kumar, Vikraman Arvind:
A heuristic search strategy for optimization of trade-off cost measures. ICTAI 1991: 400-407
1980 – 1989
- 1989
- [j2]Vikraman Arvind, Somenath Biswas:
On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. Theor. Comput. Sci. 68(2): 123-134 (1989) - 1987
- [j1]Vikraman Arvind, Somenath Biswas:
An O(n²) Algorithm for the Satisfiability Problem of a Subset of Propositional Sentences in CNF That Includes All Horn Sentences. Inf. Process. Lett. 24(1): 67-69 (1987) - [c2]Vikraman Arvind, Somenath Biswas:
On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. FSTTCS 1987: 456-469 - [c1]Vikraman Arvind, Somenath Biswas:
Expressibility of First Order Logic with a Nondeterministic Inductive Operator. STACS 1987: 323-335
Coauthor Index
[c91] [i94] [i86] [j62] [j60] [j59] [j57] [c82] [c79] [i67] [i62] [j52] [c75] [c73] [i59] [j48] [c71] [i56] [i53] [j44] [j42] [c70] [c69] [i50] [i45] [c65] [i42] [j40] [c63] [j37] [c59] [i36] [c57] [c55] [j28] [i26] [c44] [c41] [c39] [c33] [j20] [j19] [c23] [c22] [i3] [c16] [j10] [j9] [j6] [j5] [j4] [c9] [c8] [c7] [c6] [c5] [c4]
[c94] [c90] [i96] [i92] [c89] [i87] [i84] [j65] [j61] [c87] [i81] [i77] [i76] [c83] [j58] [c81] [i70] [j56] [c80] [c78] [c77] [i69] [i68] [i66] [j53] [c76] [i65] [i64] [i63] [i61] [c74] [c72] [i60] [i58] [i57] [i55] [i54] [i52] [c60] [c58] [i37] [i35] [i34] [j31] [j30] [j29] [c48] [c47] [c46] [i20] [i19] [i17] [i16] [i15] [i14] [c40] [i11] [c38] [c35]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
