The SCEAS System
| |||||||

## Search the dblp DataBase
Vikraman Arvind:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Vikraman Arvind, N. V. Vinodchandran
**The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ALT, 1996, pp:100-112 [Conf] - Vikraman Arvind, N. V. Vinodchandran
**Exact Learning via Teaching Assistants (Extended Abstract).**[Citation Graph (0, 0)][DBLP] ALT, 1997, pp:291-306 [Conf] - Vikraman Arvind, Piyush P. Kurur
**On the Complexity of Computing Units in a Number Field.**[Citation Graph (0, 0)][DBLP] ANTS, 2004, pp:72-86 [Conf] - Manindra Agrawal, Vikraman Arvind
**Polynomial Time Truth-Table Reductions to P-Selective Sets.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1994, pp:24-30 [Conf] - Manindra Agrawal, Vikraman Arvind
**Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets.**[Citation Graph (0, 0)][DBLP] Structure in Complexity Theory Conference, 1995, pp:264-276 [Conf] - Manindra Agrawal, Vikraman Arvind
**A Note on Decision versus Search for Graph Automorphism.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1996, pp:272-277 [Conf] - Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
**Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2005, pp:13-27 [Conf] - Vikraman Arvind, Jacobo Torán
**Solvable Group Isomorphism.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:91-103 [Conf] - Vikraman Arvind, Jacobo Torán
**A Nonadaptive NC Checker for Permutation Group Intersection.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:204-212 [Conf] - Vikraman Arvind, T. C. Vijayaraghavan
**Abelian Permutation Group Problems and Logspace Counting Classes.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2004, pp:204-214 [Conf] - Vikraman Arvind
**A Note on the Self-Witnessing Property of Computational Problems.**[Citation Graph (0, 0)][DBLP] COCOON, 1996, pp:241-249 [Conf] - Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
**The Complexity of Black-Box Ring Problems.**[Citation Graph (0, 0)][DBLP] COCOON, 2006, pp:126-135 [Conf] - Vikraman Arvind, Bireswar Das
**SZK Proofs for Black-Box Group Problems.**[Citation Graph (0, 0)][DBLP] CSR, 2006, pp:6-17 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Complexity Theory: Current Research, 1992, pp:1-46 [Conf] - Vikraman Arvind, Piyush P. Kurur
**Graph Isomorphism is in SPP.**[Citation Graph (0, 0)][DBLP] FOCS, 2002, pp:743-750 [Conf] - Vikraman Arvind, Somenath Biswas
**On Certain Bandwidth Restricted Versions of the Satisfaiability Problem of Propositional CNF Formulas.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1987, pp:456-469 [Conf] - Vikraman Arvind, Johannes Köbler
**On Resource-Bounded Measure and Pseudorandomness.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1997, pp:235-249 [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets.**[Citation Graph (0, 0)][DBLP] FSTTCS, 1992, pp:140-151 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] ICALP, 1992, pp:162-173 [Conf] - Vikraman Arvind, Johannes Köbler, Rainer Schuler
**On Helping and Interactive Proof Systems.**[Citation Graph (0, 0)][DBLP] ISAAC, 1994, pp:137-145 [Conf] - Vikraman Arvind, Venkatesh Raman
**Approximation Algorithms for Some Parameterized Counting Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2002, pp:453-464 [Conf] - Vikraman Arvind, Rainer Schuler
**The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:168-177 [Conf] - Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay
**On Isomorphism and Canonization of Tournaments and Hypertournaments.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:449-459 [Conf] - Vikraman Arvind, Piyush P. Kurur
**Upper Bounds on the Complexity of Some Galois Theory Problems.**[Citation Graph (0, 0)][DBLP] ISAAC, 2003, pp:716-725 [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Lowness and the Complexity of Sparse and Tally Descriptions.**[Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:249-258 [Conf] - Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
**The Query Complexity of Program Checking by Constant-Depth Circuits.**[Citation Graph (0, 0)][DBLP] ISAAC, 1999, pp:123-132 [Conf] - Vikraman Arvind, Jacobo Torán
**The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem.**[Citation Graph (0, 0)][DBLP] ISAAC, 2006, pp:233-242 [Conf] - Vikraman Arvind, Piyush P. Kurur
**A Polynomial Time Nilpotence Test for Galois Groups and Related Results.**[Citation Graph (0, 0)][DBLP] MFCS, 2006, pp:134-145 [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Hausdorff Reductions to Sparse Sets and to Sets of High Information Content.**[Citation Graph (0, 0)][DBLP] MFCS, 1993, pp:232-241 [Conf] - Vikraman Arvind, Somenath Biswas
**Expressibility of First Order Logic with a Nondeterministic Inductive Operator.**[Citation Graph (0, 0)][DBLP] STACS, 1987, pp:323-335 [Conf] - Vikraman Arvind, Richard Beigel, Antoni Lozano
**The Complexity of Modular Graph Automorphism.**[Citation Graph (0, 0)][DBLP] STACS, 1998, pp:172-182 [Conf] - Vikraman Arvind, Johannes Köbler
**Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results.**[Citation Graph (0, 0)][DBLP] STACS, 2000, pp:431-442 [Conf] - Vikraman Arvind, Johannes Köbler
**On Hypergraph and Graph Isomorphism with Bounded Color Classes.**[Citation Graph (0, 0)][DBLP] STACS, 2006, pp:384-395 [Conf] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán
**Nondeterministic Instance Complexity and Hard-to-Prove Tautologies.**[Citation Graph (0, 0)][DBLP] STACS, 2000, pp:314-323 [Conf] - Vikraman Arvind, Jacobo Torán
**Sparse Sets, Approximable Sets, and Parallel Queries to NP.**[Citation Graph (0, 0)][DBLP] STACS, 1999, pp:281-290 [Conf] - Vikraman Arvind, T. C. Vijayaraghavan
**The Complexity of Solving Linear Equations over a Finite Ring.**[Citation Graph (0, 0)][DBLP] STACS, 2005, pp:472-484 [Conf] - Vikraman Arvind, N. V. Vinodchandran
**Solvable Black-Box Group Problems Are Low for PP.**[Citation Graph (0, 0)][DBLP] STACS, 1996, pp:99-110 [Conf] - Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
**The Query Complexity of Program Checking by Constant-Depth Circuits.**[Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 2002, v:2002, n:, pp:- [Journal] - Vikraman Arvind, Jacobo Torán
**Isomorphism Testing: Perspective and Open Problems.**[Citation Graph (0, 0)][DBLP] Bulletin of the EATCS, 2005, v:86, n:, pp:66-84 [Journal] - Vikraman Arvind, Venkatesh Raman
**Approximate Counting small subgraphs of bounded treewidth and related problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:031, pp:- [Journal] - Vikraman Arvind, Piyush P. Kurur
**Graph Isomorphism is in SPP**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:037, pp:- [Journal] - Vikraman Arvind, Piyush P. Kurur
**Upper Bounds on the Complexity of some Galois Theory Problems**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:064, pp:- [Journal] - Vikraman Arvind, Jacobo Torán
**Solvable Group Isomorphism is (almost) in NP\cap coNP**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:008, pp:- [Journal] - Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan
**Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy.**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:121, pp:- [Journal] - Vikraman Arvind, Jacobo Torán
**Sparse Sets, Approximable Sets, and Parallel Queries to NP**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:27, pp:- [Journal] - Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran
**The Query Complexity of Program Checking by Constant-Depth Circuits**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1998, v:5, n:78, pp:- [Journal] - Eric Allender, Vikraman Arvind, Meena Mahajan
**Arithmetic Complexity, Kleene Closure, and Formal Power Series**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:8, pp:- [Journal] - Vikraman Arvind, Johannes Köbler
**Graph Isomorphism is Low for ZPP**[Citation Graph (0, 0)][DBLP]^{NP}and other Lowness results. Electronic Colloquium on Computational Complexity (ECCC), 1999, v:6, n:33, pp:- [Journal] - Manindra Agrawal, Vikraman Arvind
**A Note on Decision versus Search for Graph Automorphism.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 1996, v:131, n:2, pp:179-189 [Journal] - Vikraman Arvind, Piyush P. Kurur
**Graph Isomorphism is in SPP.**[Citation Graph (0, 0)][DBLP] Inf. Comput., 2006, v:204, n:5, pp:835-852 [Journal] - Vikraman Arvind
**Constructivizing Membership Proofs in Complexity Classes.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1997, v:8, n:4, pp:433-0 [Journal] - Vikraman Arvind, Somenath Biswas
**Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:83-99 [Journal] - Vikraman Arvind, Johannes Köbler, Rainer Schuler
**On Helping and Interactive Proof Systems.**[Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1995, v:6, n:2, pp:137-153 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1987, v:24, n:1, pp:67-69 [Journal] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**On Reductions to Sets that Avoid EXPSPACE.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1995, v:56, n:2, pp:109-114 [Journal] - Vikraman Arvind, Jacobo Torán
**Sparse Sets, Approximable Sets, and Parallel Queries to NP.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1999, v:69, n:4, pp:181-188 [Journal] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Monotonous and Randomized Reductions to Sparse Sets.**[Citation Graph (0, 0)][DBLP] ITA, 1996, v:30, n:2, pp:155-179 [Journal] - Vikraman Arvind, Johannes Köbler
**New Lowness Results for ZPPNP and Other Complexity Classes.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:2, pp:257-277 [Journal] - Eric Allender, Vikraman Arvind, Meena Mahajan
**Arithmetic Complexity, Kleene Closure, and Formal Power Series.**[Citation Graph (0, 0)][DBLP] Theory Comput. Syst., 2003, v:36, n:4, pp:303-328 [Journal] - Vikraman Arvind, Johannes Köbler, Martin Mundhenk
**Upper Bounds for the Complexity of Sparse and Tally Descriptions.**[Citation Graph (0, 0)][DBLP] Mathematical Systems Theory, 1996, v:29, n:1, pp:63-94 [Journal] - Vikraman Arvind, Richard Beigel, Antoni Lozano
**The Complexity of Modular Graph Automorphism.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:4, pp:1299-1320 [Journal] - Manindra Agrawal, Vikraman Arvind
**Geometric Sets of Low Information Content.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:193-219 [Journal] - Manindra Agrawal, Vikraman Arvind
**Quasi-Linear Truth-Table Reductions to p-Selective Sets.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:158, n:1&2, pp:361-370 [Journal] - Vikraman Arvind, Somenath Biswas
**On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1989, v:68, n:2, pp:123-134 [Journal] - Vikraman Arvind, Johannes Köbler
**On pseudorandomness and resource-bounded measure.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:255, n:1-2, pp:205-221 [Journal] - Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler
**If NP has Polynomial-Size Circuits, then MA=AM.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:137, n:2, pp:279-282 [Journal] - Vikraman Arvind, Jacobo Torán
**A nonadaptive NC checker for permutation group intersection.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2001, v:259, n:1-2, pp:597-611 [Journal] - Vikraman Arvind, N. V. Vinodchandran
**Exact learning via teaching assistants.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:241, n:1-2, pp:51-81 [Journal] - Vikraman Arvind, N. V. Vinodchandran
**The counting complexity of group-definable languages.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2000, v:242, n:1-2, pp:199-218 [Journal] - Vikraman Arvind, N. V. Vinodchandran
**Solvable Black-Box Group Problems are Low for PP.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1997, v:180, n:1-2, pp:17-45 [Journal] - Vikraman Arvind, Johannes Köbler, Wolfgang Lindner
**Parameterized Learnability of**[Citation Graph (0, 0)][DBLP]*k*-Juntas and Related Problems. ALT, 2007, pp:120-134 [Conf] - V. Arvind, Christine T. Cheng, Nikhil R. Devanur
**On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Vikraman Arvind, Piyush P. Kurur
**A Polynomial Time Nilpotence Test for Galois Groups and Related Results**[Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp:- [Journal] **Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size.**[Citation Graph (, )][DBLP]**Uniform Derandomization from Pathetic Lower Bounds.**[Citation Graph (, )][DBLP]**New Results on Noncommutative and Commutative Polynomial Identity Testing.**[Citation Graph (, )][DBLP]**The Orbit Problem Is in the GapL Hierarchy.**[Citation Graph (, )][DBLP]**A Logspace Algorithm for Partial 2-Tree Canonization.**[Citation Graph (, )][DBLP]**Arithmetic Circuits and the Hadamard Product of Polynomials.**[Citation Graph (, )][DBLP]**Some Sieving Algorithms for Lattice Problems.**[Citation Graph (, )][DBLP]**The Space Complexity of**[Citation Graph (, )][DBLP]*k*-Tree Isomorphism.**The Monomial Ideal Membership Problem and Polynomial Identity Testing.**[Citation Graph (, )][DBLP]**Arithmetic Circuits, Monomial Algebras and Finite Automata.**[Citation Graph (, )][DBLP]**Algorithmic Problems for Metrics on Permutation Groups.**[Citation Graph (, )][DBLP]**The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets.**[Citation Graph (, )][DBLP]**Quantum Query Complexity of Multilinear Identity Testing.**[Citation Graph (, )][DBLP]**On the hardness of the noncommutative determinant.**[Citation Graph (, )][DBLP]**Circuit Lower Bounds, Help Functions, and the Remote Point Problem.**[Citation Graph (, )][DBLP]**Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes.**[Citation Graph (, )][DBLP]**New results on Noncommutative and Commutative Polynomial Identity Testing**[Citation Graph (, )][DBLP]**Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size**[Citation Graph (, )][DBLP]**Lattice Problems, Gauge Functions and Parameterized Algorithms**[Citation Graph (, )][DBLP]**Quantum Query Complexity of Multilinear Identity Testing**[Citation Graph (, )][DBLP]**On Lower Bounds for Constant Width Arithmetic Circuits**[Citation Graph (, )][DBLP]**Arithmetic Circuits and the Hadamard Product of Polynomials**[Citation Graph (, )][DBLP]**The Remote Point Problem, Small Bias Space, and Expanding Generator Sets**[Citation Graph (, )][DBLP]**On the hardness of the noncommutative determinant**[Citation Graph (, )][DBLP]**Circuit Lower Bounds, Help Functions, and the Remote Point Problem**[Citation Graph (, )][DBLP]**The Orbit problem is in the GapL Hierarchy.**[Citation Graph (, )][DBLP]**New results on Noncommutative and Commutative Polynomial Identity Testing.**[Citation Graph (, )][DBLP]**Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size.**[Citation Graph (, )][DBLP]**Quantum Query Complexity of Multilinear Identity Testing.**[Citation Graph (, )][DBLP]**The Ideal Membership Problem and Polynomial Identity Testing.**[Citation Graph (, )][DBLP]
Search in 0.072secs, Finished in 0.076secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |