dblp.uni-trier.dewww.uni-trier.de

Vikraman Arvind Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
99EEVikraman Arvind, Pushkar S. Joglekar: Arithmetic Circuits, Monomial Algebras and Finite Automata. MFCS 2009: 78-89
98EEVikraman Arvind, Partha Mukhopadhyay: Quantum Query Complexity of Multilinear Identity Testing. STACS 2009: 87-98
97EEVikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan: On Lower Bounds for Constant Width Arithmetic Circuits CoRR abs/0907.3780: (2009)
96EEVikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan: Arithmetic Circuits and the Hadamard Product of Polynomials CoRR abs/0907.4006: (2009)
95EEVikraman Arvind, Srikanth Srinivasan: The Remote Point Problem, Small Bias Space, and Expanding Generator Sets CoRR abs/0909.5313: (2009)
94EEVikraman Arvind, Srikanth Srinivasan: On the hardness of the noncommutative determinant CoRR abs/0910.2370: (2009)
2008
93EEVikraman Arvind, Partha Mukhopadhyay: Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. APPROX-RANDOM 2008: 276-289
92EEVikraman Arvind, T. C. Vijayaraghavan: The Orbit Problem Is in the GapL Hierarchy. COCOON 2008: 160-169
91EEVikraman Arvind, Bireswar Das, Johannes Köbler: A Logspace Algorithm for Partial 2-Tree Canonization. CSR 2008: 40-51
90EEVikraman Arvind, Pushkar S. Joglekar: Some Sieving Algorithms for Lattice Problems. FSTTCS 2008
89EEVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan: New Results on Noncommutative and Commutative Polynomial Identity Testing. IEEE Conference on Computational Complexity 2008: 268-279
88EEVikraman Arvind, Pushkar S. Joglekar: Algorithmic Problems for Metrics on Permutation Groups. SOFSEM 2008: 136-147
87EEVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan: New results on Noncommutative and Commutative Polynomial Identity Testing CoRR abs/0801.0514: (2008)
86EEVikraman Arvind, Partha Mukhopadhyay: Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size CoRR abs/0804.0957: (2008)
85EEVikraman Arvind, Pushkar S. Joglekar: Lattice Problems, Gauge Functions and Parameterized Algorithms CoRR abs/0804.4744: (2008)
84EEVikraman Arvind, Partha Mukhopadhyay: Quantum Query Complexity of Multilinear Identity Testing CoRR abs/0807.1412: (2008)
83EEVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan: New results on Noncommutative and Commutative Polynomial Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 15(025): (2008)
82EEVikraman Arvind, Partha Mukhopadhyay: Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. Electronic Colloquium on Computational Complexity (ECCC) 15(049): (2008)
81EEVikraman Arvind, T. C. Vijayaraghavan: The Orbit problem is in the GapL Hierarchy. Electronic Colloquium on Computational Complexity (ECCC) 15(052): (2008)
80EEVikraman Arvind, Partha Mukhopadhyay: Quantum Query Complexity of Multilinear Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 15(086): (2008)
79EEVikraman Arvind, Bireswar Das: SZK Proofs for Black-Box Group Problems. Theory Comput. Syst. 43(2): 100-117 (2008)
2007
78 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 Springer 2007
77EEVikraman Arvind, Johannes Köbler, Wolfgang Lindner: Parameterized Learnability of k -Juntas and Related Problems. ALT 2007: 120-134
76EEVikraman Arvind, Partha Mukhopadhyay: The Monomial Ideal Membership Problem and Polynomial Identity Testing. ISAAC 2007: 800-811
75EEVikraman Arvind, Bireswar Das, Johannes Köbler: The Space Complexity of k -Tree Isomorphism. ISAAC 2007: 822-833
74EEVikraman 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)
73EEVikraman Arvind, Partha Mukhopadhyay: The Ideal Membership Problem and Polynomial Identity Testing. Electronic Colloquium on Computational Complexity (ECCC) 14(095): (2007)
2006
72EEVikraman Arvind, Bireswar Das, Partha Mukhopadhyay: The Complexity of Black-Box Ring Problems. COCOON 2006: 126-135
71EEVikraman Arvind, Bireswar Das: SZK Proofs for Black-Box Group Problems. CSR 2006: 6-17
70EEVikraman Arvind, Jacobo Torán: The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. ISAAC 2006: 233-242
69EEVikraman Arvind, Bireswar Das, Partha Mukhopadhyay: On Isomorphism and Canonization of Tournaments and Hypertournaments. ISAAC 2006: 449-459
68EEVikraman Arvind, Piyush P. Kurur: A Polynomial Time Nilpotence Test for Galois Groups and Related Results. MFCS 2006: 134-145
67EEVikraman Arvind, Johannes Köbler: On Hypergraph and Graph Isomorphism with Bounded Color Classes. STACS 2006: 384-395
66EEVikraman Arvind, Piyush P. Kurur: A Polynomial Time Nilpotence Test for Galois Groups and Related Results CoRR abs/cs/0605050: (2006)
65EEVikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP. Inf. Comput. 204(5): 835-852 (2006)
2005
64EEVikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan: Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. IEEE Conference on Computational Complexity 2005: 13-27
63EEVikraman Arvind, T. C. Vijayaraghavan: The Complexity of Solving Linear Equations over a Finite Ring. STACS 2005: 472-484
62 Vikraman Arvind, Jacobo Torán: Isomorphism Testing: Perspective and Open Problems. Bulletin of the EATCS 86: 66-84 (2005)
2004
61EEVikraman Arvind, Piyush P. Kurur: On the Complexity of Computing Units in a Number Field. ANTS 2004: 72-86
60EEVikraman Arvind, T. C. Vijayaraghavan: Abelian Permutation Group Problems and Logspace Counting Classes. IEEE Conference on Computational Complexity 2004: 204-214
59EEVikraman Arvind, Jacobo Torán: Solvable Group Isomorphism. IEEE Conference on Computational Complexity 2004: 91-103
58EEVikraman Arvind, Jacobo Torán: Solvable Group Isomorphism is (almost) in NP\cap coNP Electronic Colloquium on Computational Complexity (ECCC)(008): (2004)
57EEVikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan: Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. Electronic Colloquium on Computational Complexity (ECCC)(121): (2004)
2003
56EEVikraman Arvind, Rainer Schuler: The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. ISAAC 2003: 168-177
55EEVikraman Arvind, Piyush P. Kurur: Upper Bounds on the Complexity of Some Galois Theory Problems. ISAAC 2003: 716-725
54EEVikraman Arvind, Piyush P. Kurur: Upper Bounds on the Complexity of some Galois Theory Problems Electronic Colloquium on Computational Complexity (ECCC)(064): (2003)
53EEEric Allender, Vikraman Arvind, Meena Mahajan: Arithmetic Complexity, Kleene Closure, and Formal Power Series. Theory Comput. Syst. 36(4): 303-328 (2003)
2002
52EEVikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP. FOCS 2002: 743-750
51EEVikraman Arvind, Venkatesh Raman: Approximation Algorithms for Some Parameterized Counting Problems. ISAAC 2002: 453-464
50EEVikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits. Chicago J. Theor. Comput. Sci. 2002: (2002)
49EEVikraman Arvind, Venkatesh Raman: Approximate Counting small subgraphs of bounded treewidth and related problems Electronic Colloquium on Computational Complexity (ECCC)(031): (2002)
48EEVikraman Arvind, Piyush P. Kurur: Graph Isomorphism is in SPP Electronic Colloquium on Computational Complexity (ECCC)(037): (2002)
47EEVikraman Arvind, Johannes Köbler: New Lowness Results for ZPPNP and Other Complexity Classes. J. Comput. Syst. Sci. 65(2): 257-277 (2002)
2001
46EEVikraman Arvind, Johannes Köbler: On pseudorandomness and resource-bounded measure. Theor. Comput. Sci. 255(1-2): 205-221 (2001)
45EEVikraman Arvind, Jacobo Torán: A nonadaptive NC checker for permutation group intersection. Theor. Comput. Sci. 259(1-2): 597-611 (2001)
2000
44EEVikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán: Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. STACS 2000: 314-323
43EEVikraman Arvind, Johannes Köbler: Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. STACS 2000: 431-442
42EEVikraman Arvind, Richard Beigel, Antoni Lozano: The Complexity of Modular Graph Automorphism. SIAM J. Comput. 30(4): 1299-1320 (2000)
41EEVikraman Arvind, N. V. Vinodchandran: Exact learning via teaching assistants. Theor. Comput. Sci. 241(1-2): 51-81 (2000)
40EEVikraman Arvind, N. V. Vinodchandran: The counting complexity of group-definable languages. Theor. Comput. Sci. 242(1-2): 199-218 (2000)
1999
39EEVikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132
38EEVikraman Arvind, Jacobo Torán: Sparse Sets, Approximable Sets, and Parallel Queries to NP. STACS 1999: 281-290
37EEVikraman Arvind, Johannes Köbler: Graph Isomorphism is Low for ZPPNP and other Lowness results. Electronic Colloquium on Computational Complexity (ECCC) 6(33): (1999)
36EEEric Allender, Vikraman Arvind, Meena Mahajan: Arithmetic Complexity, Kleene Closure, and Formal Power Series Electronic Colloquium on Computational Complexity (ECCC) 6(8): (1999)
35EEVikraman Arvind, Jacobo Torán: Sparse Sets, Approximable Sets, and Parallel Queries to NP. Inf. Process. Lett. 69(4): 181-188 (1999)
1998
34 Vikraman Arvind, Ramaswamy Ramanujam: Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings Springer 1998
33EEVikraman Arvind, Richard Beigel, Antoni Lozano: The Complexity of Modular Graph Automorphism. STACS 1998: 172-182
32EEVikraman Arvind, Jacobo Torán: Sparse Sets, Approximable Sets, and Parallel Queries to NP Electronic Colloquium on Computational Complexity (ECCC) 5(27): (1998)
31EEVikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran: The Query Complexity of Program Checking by Constant-Depth Circuits Electronic Colloquium on Computational Complexity (ECCC) 5(78): (1998)
1997
30 Vikraman Arvind, N. V. Vinodchandran: Exact Learning via Teaching Assistants (Extended Abstract). ALT 1997: 291-306
29EEVikraman Arvind, Johannes Köbler: On Resource-Bounded Measure and Pseudorandomness. FSTTCS 1997: 235-249
28EEVikraman Arvind, Jacobo Torán: A Nonadaptive NC Checker for Permutation Group Intersection. IEEE Conference on Computational Complexity 1997: 204-212
27 Vikraman Arvind: Constructivizing Membership Proofs in Complexity Classes. Int. J. Found. Comput. Sci. 8(4): 433- (1997)
26EEVikraman Arvind, N. V. Vinodchandran: Solvable Black-Box Group Problems are Low for PP. Theor. Comput. Sci. 180(1-2): 17-45 (1997)
1996
25 Vikraman Arvind, N. V. Vinodchandran: The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract). ALT 1996: 100-112
24 Vikraman Arvind: A Note on the Self-Witnessing Property of Computational Problems. COCOON 1996: 241-249
23EEManindra Agrawal, Vikraman Arvind: A Note on Decision versus Search for Graph Automorphism. IEEE Conference on Computational Complexity 1996: 272-277
22EEVikraman Arvind, N. V. Vinodchandran: Solvable Black-Box Group Problems Are Low for PP. STACS 1996: 99-110
21 Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Monotonous and Randomized Reductions to Sparse Sets. ITA 30(2): 155-179 (1996)
20 Manindra Agrawal, Vikraman Arvind: A Note on Decision versus Search for Graph Automorphism. Inf. Comput. 131(2): 179-189 (1996)
19 Vikraman Arvind, Johannes Köbler, Martin Mundhenk: Upper Bounds for the Complexity of Sparse and Tally Descriptions. Mathematical Systems Theory 29(1): 63-94 (1996)
18EEManindra Agrawal, Vikraman Arvind: Geometric Sets of Low Information Content. Theor. Comput. Sci. 158(1&2): 193-219 (1996)
17EEManindra Agrawal, Vikraman Arvind: Quasi-Linear Truth-Table Reductions to p-Selective Sets. Theor. Comput. Sci. 158(1&2): 361-370 (1996)
1995
16 Manindra Agrawal, Vikraman Arvind: Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. Structure in Complexity Theory Conference 1995: 264-276
15EEVikraman Arvind, Johannes Köbler, Martin Mundhenk: On Reductions to Sets that Avoid EXPSPACE. Inf. Process. Lett. 56(2): 109-114 (1995)
14 Vikraman Arvind, Johannes Köbler, Rainer Schuler: On Helping and Interactive Proof Systems. Int. J. Found. Comput. Sci. 6(2): 137-153 (1995)
13EEVikraman 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)
1994
12EEVikraman Arvind, Johannes Köbler, Rainer Schuler: On Helping and Interactive Proof Systems. ISAAC 1994: 137-145
11 Manindra Agrawal, Vikraman Arvind: Polynomial Time Truth-Table Reductions to P-Selective Sets. Structure in Complexity Theory Conference 1994: 24-30
1993
10EEVikraman Arvind, Johannes Köbler, Martin Mundhenk: Hausdorff Reductions to Sparse Sets and to Sets of High Information Content. MFCS 1993: 232-241
1992
9 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
8EEVikraman Arvind, Johannes Köbler, Martin Mundhenk: On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets. FSTTCS 1992: 140-151
7EEVikraman 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
6EEVikraman Arvind, Johannes Köbler, Martin Mundhenk: Lowness and the Complexity of Sparse and Tally Descriptions. ISAAC 1992: 249-258
1991
5 Vikraman Arvind, Somenath Biswas: Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. Int. J. Found. Comput. Sci. 2(2): 83-99 (1991)
1989
4 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
3EEVikraman Arvind, Somenath Biswas: On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas. FSTTCS 1987: 456-469
2EEVikraman Arvind, Somenath Biswas: Expressibility of First Order Logic with a Nondeterministic Inductive Operator. STACS 1987: 323-335
1 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)

Coauthor Index

1Manindra Agrawal [11] [16] [17] [18] [20] [23]
2Eric Allender [36] [53]
3Richard Beigel [33] [42]
4Somenath Biswas [1] [2] [3] [4] [5]
5Christine T. Cheng [74]
6Bireswar Das [69] [71] [72] [75] [79] [91]
7Nikhil R. Devanur [74]
8Yenjo Han [7] [9]
9Lane A. Hemaspaandra (Lane A. Hemachandra) [7] [9]
10Pushkar S. Joglekar [85] [88] [90] [96] [97] [99]
11Johannes Köbler [6] [7] [8] [9] [10] [12] [13] [14] [15] [19] [21] [29] [37] [43] [44] [46] [47] [67] [75] [77] [91]
12Piyush P. Kurur [48] [52] [54] [55] [57] [61] [64] [65] [66] [68]
13Wolfgang Lindner [77]
14Antoni Lozano [7] [9] [33] [42]
15Meena Mahajan [36] [53]
16Partha Mukhopadhyay [69] [72] [73] [76] [80] [82] [83] [84] [86] [87] [89] [93] [98]
17Martin Mundhenk [6] [7] [8] [9] [10] [15] [19] [21] [44]
18Mitsunori Ogihara (Mitsunori Ogiwara) [7] [9]
19Sanjiva Prasad [78]
20Venkatesh Raman [49] [51]
21Ramaswamy Ramanujam [34]
22Uwe Schöning [7] [9] [13]
23Rainer Schuler [12] [13] [14] [56]
24Riccardo Silvestri [7] [9]
25Srikanth Srinivasan [83] [87] [89] [94] [95] [96] [97]
26K. V. Subrahmanyam [31] [39] [50]
27Thomas Thierauf [7] [9]
28Jacobo Torán [28] [32] [35] [38] [44] [45] [58] [59] [62] [70]
29T. C. Vijayaraghavan [57] [60] [63] [64] [81] [92]
30N. V. Vinodchandran (N. Variyam Vinodchandran) [22] [25] [26] [30] [31] [39] [40] [41] [50]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)