Vikraman Arvind - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

2010

Uniform Derandomization from Pathetic Lower BoundsEric Allender, Vikraman Arvind, Fengming Wang. eccc, 17:69, 2010. [doi]

Uniform Derandomization from Pathetic Lower BoundsEric Allender, Vikraman Arvind, Fengming Wang. approx 2010: 380-393 [doi]

The Remote Point Problem, Small Bias Spaces, and Expanding Generator SetsVikraman Arvind, Srikanth Srinivasan. STACS 2010: 59-70 [doi]

On the hardness of the noncommutative determinantVikraman Arvind, Srikanth Srinivasan. stoc 2010: 677-686 [doi]

Isomorphism and canonization of tournaments and hypertournamentsVikraman Arvind, Bireswar Das, Partha Mukhopadhyay. jcss, 76(7):509-523, 2010. [doi]

Colored Hypergraph Isomorphism is Fixed Parameter TractableVikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. fsttcs 2010: 327-337 [doi]

New Results on Noncommutative and Commutative Polynomial Identity TestingVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. cc, 19(4):521-558, 2010. [doi]

The ideal membership problem and polynomial identity testingVikraman Arvind, Partha Mukhopadhyay. iandc, 208(4):351-363, 2010. [doi]

Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting ClassesVikraman Arvind, T. C. Vijayaraghavan. cc, 19(1):57-98, 2010. [doi]

2009

Arithmetic Circuits and the Hadamard Product of PolynomialsVikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan. fsttcs 2009: 25-36 [doi]

Parameterized learnability of juntasVikraman Arvind, Johannes KÃ¶bler, Wolfgang Lindner. TCS, 410(47-49):4928-4936, 2009. [doi]

Circuit Lower Bounds, Help Functions, and the Remote Point ProblemVikraman Arvind, Srikanth Srinivasan. eccc, 16:122, 2009. [doi]

Colored Hypergraph Isomorphism is Fixed Parameter TractableVikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda. eccc, 16:93, 2009. [doi]

On Lower Bounds for Constant Width Arithmetic CircuitsVikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan. eccc, 16:73, 2009. [doi]

The Remote Point Problem, Small Bias Spaces, and Expanding Generator SetsVikraman Arvind, Srikanth Srinivasan. eccc, 16:105, 2009. [doi]

Arithmetic Circuits, Monomial Algebras and Finite AutomataVikraman Arvind, Pushkar S. Joglekar. mfcs 2009: 78-89 [doi]

Arithmetic Circuit Size, Identity Testing, and Finite AutomataVikraman Arvind, Pushkar S. Joglekar. eccc, 16:26, 2009. [doi]

Quantum Query Complexity of Multilinear Identity TestingVikraman Arvind, Partha Mukhopadhyay. STACS 2009: 87-98 [doi]

2008

SZK Proofs for Black-Box Group ProblemsVikraman Arvind, Bireswar Das. mst, 43(2):100-117, 2008. [doi]

A Logspace Algorithm for Partial 2-Tree CanonizationVikraman Arvind, Bireswar Das, Johannes Köbler. csr 2008: 40-51 [doi]

Derandomizing the Isolation Lemma and Lower Bounds for Circuit SizeVikraman Arvind, Partha Mukhopadhyay. approx 2008: 276-289 [doi]

Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit SizeVikraman Arvind, Partha Mukhopadhyay. eccc, 15(049), 2008. [doi]

New results on Noncommutative and Commutative Polynomial Identity TestingVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. eccc, 15(025), 2008. [doi]

Quantum Query Complexity of Multilinear Identity TestingVikraman Arvind, Partha Mukhopadhyay. eccc, 15(086), 2008. [doi]

New Results on Noncommutative and Commutative Polynomial Identity TestingVikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan. coco 2008: 268-279 [doi]

The Orbit Problem Is in the GapL HierarchyVikraman Arvind, T. C. Vijayaraghavan. cocoon 2008: 160-169 [doi]

The Orbit problem is in the GapL HierarchyVikraman Arvind, T. C. Vijayaraghavan. eccc, 15(052), 2008. [doi]

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting ApproachVikraman Arvind, Christine T. Cheng, Nikhil R. Devanur. siamdm, 22(4):1297-1324, 2008. [doi]

2007

2006

SZK Proofs for Black-Box Group ProblemsVikraman Arvind, Bireswar Das. csr 2006: 6-17 [doi]

The Complexity of Black-Box Ring ProblemsVikraman Arvind, Bireswar Das, Partha Mukhopadhyay. cocoon 2006: 126-135 [doi]

On Isomorphism and Canonization of Tournaments and HypertournamentsVikraman Arvind, Bireswar Das, Partha Mukhopadhyay. isaac 2006: 449-459 [doi]

The Complexity of Quasigroup Isomorphism and the Minimum Generating Set ProblemVikraman Arvind, Jacobo Torán. isaac 2006: 233-242 [doi]

A Polynomial Time Nilpotence Test for Galois Groups and Related ResultsVikraman Arvind, Piyush P. Kurur. mfcs 2006: 134-145 [doi]

On Hypergraph and Graph Isomorphism with Bounded Color ClassesVikraman Arvind, Johannes Köbler. STACS 2006: 384-395 [doi]

Graph Isomorphism is in SPPVikraman Arvind, Piyush P. Kurur. iandc, 204(5):835-852, 2006. [doi]

2005

Isomorphism Testing: Perspective and Open ProblemsVikraman Arvind, Jacobo Torán. eatcs, 86:66-84, 2005.

The Complexity of Solving Linear Equations over a Finite RingVikraman Arvind, T. C. Vijayaraghavan. STACS 2005: 472-484 [doi]

Bounded Color Multiplicity Graph Isomorphism is in the #L HierarchyVikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan. cocoon 2005: 13-27 [doi]

2004

2003

2002

2001

On pseudorandomness and resource-bounded measureVikraman Arvind, Johannes Köbler. TCS, 255(1-2):205-221, 2001. [doi]

A nonadaptive NC checker for permutation group intersectionVikraman Arvind, Jacobo Torán. TCS, 259(1-2):597-611, 2001. [doi]

2000

1999

1998

The Query Complexity of Program Checking by Constant-Depth CircuitsVikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran. eccc, 5(78), 1998. [doi]

Sparse Sets, Approximable Sets, and Parallel Queries to NPVikraman Arvind, Jacobo Torán. eccc, 5(27), 1998. [doi]

Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, ProceedingsVikraman Arvind, Ramaswamy Ramanujam, editors, Volume 1530 of Lecture Notes in Computer Science, Springer, 1998.

The Complexity of Modular Graph AutomorphismVikraman Arvind, Richard Beigel, Antoni Lozano. STACS 1998: 172-182

1997

1996

Quasi-Linear Truth-Table Reductions to p-Selective SetsManindra Agrawal, Vikraman Arvind. TCS, 158(1&2):361-370, 1996. [doi]

Geometric Sets of Low Information ContentManindra Agrawal, Vikraman Arvind. TCS, 158(1&2):193-219, 1996. [doi]

A Note on Decision versus Search for Graph AutomorphismManindra Agrawal, Vikraman Arvind. cocoon 1996: 272-277 [doi]

A Note on Decision versus Search for Graph AutomorphismManindra Agrawal, Vikraman Arvind. iandc, 131(2):179-189, 1996.

Solvable Black-Box Group Problems Are Low for PPVikraman Arvind, N. V. Vinodchandran. STACS 1996: 99-110

A Note on the Self-Witnessing Property of Computational ProblemsVikraman Arvind. cocoon 1996: 241-249

Monotonous and Randomized Reductions to Sparse SetsVikraman Arvind, Johannes Köbler, Martin Mundhenk. ita, 30(2):155-179, 1996.

Upper Bounds for the Complexity of Sparse and Tally DescriptionsVikraman Arvind, Johannes Köbler, Martin Mundhenk. mst, 29(1):63-94, 1996.

The Complexity of Exactly Learning Algebraic Concepts. (Extended Abstract)Vikraman Arvind, N. V. Vinodchandran. alt 1996: 100-112

1995

1994

Polynomial Time Truth-Table Reductions to P-Selective SetsManindra Agrawal, Vikraman Arvind. cocoon 1994: 24-30

On Helping and Interactive Proof SystemsVikraman Arvind, Johannes Köbler, Rainer Schuler. isaac 1994: 137-145

1993

Hausdorff Reductions to Sparse Sets and to Sets of High Information ContentVikraman Arvind, Johannes Köbler, Martin Mundhenk. mfcs 1993: 232-241

1992

On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse SetsVikraman Arvind, Johannes Köbler, Martin Mundhenk. fsttcs 1992: 140-151

PreviousNext