| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Near-Optimal Expanding Generating Sets for Solvable Permutation Groups  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Yadu Vasudev |
Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits. |
LATA |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs. |
LATIN |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP. |
TOCT |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, T. C. Vijayaraghavan |
The orbit problem is in the GapL hierarchy. |
J. Comb. Optim. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev |
Expanding Generator Sets for Solvable Permutation Groups. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Yadu Vasudev |
Isomorphism Testing of Boolean Functions Computable by Constant Depth Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar |
Erdos-Renyi Sequences and Deterministic construction of Expanding Cayley Graphs. |
Electronic Colloquium on Computational Complexity (ECCC) |
2011 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler |
Canonizing Hypergraphs under Abelian Group Action. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Vikraman Arvind, Fengming Wang |
Uniform Derandomization from Pathetic Lower Bounds. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
The ideal membership problem and polynomial identity testing. |
Inf. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, T. C. Vijayaraghavan |
Classifying Problems on Linear Congruences and Abelian Permutation Groups Using Logspace Counting Classes. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New Results on Noncommutative and Commutative Polynomial Identity Testing. |
Computational Complexity |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
Isomorphism and canonization of tournaments and hypertournaments. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. |
STACS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Vikraman Arvind, Fengming Wang |
Uniform Derandomization from Pathetic Lower Bounds. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
Circuit Lower Bounds, Help Functions, and the Remote Point Problem. |
ICS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda |
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. |
FSTTCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
On the hardness of the noncommutative determinant. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
noncommutative rings, determinant, arithmetic circuits, permanent |
| 1 | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
On Lower Bounds for Constant Width Arithmetic Circuits. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
On the Hardness of the Noncommutative Determinant. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
The Remote Point Problem, Small Bias Spaces, and Expanding Generator Sets. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar |
Arithmetic Circuit Size, Identity Testing, and Finite Automata. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Johannes Köbler, Seinosuke Toda |
Colored Hypergraph Isomorphism is Fixed Parameter Tractable. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
Circuit Lower Bounds, Help Functions, and the Remote Point Problem. |
Electronic Colloquium on Computational Complexity (ECCC) |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Wolfgang Lindner |
Parameterized learnability of juntas. |
Theor. Comput. Sci. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
Circuit Lower Bounds, Help Functions, and the Remote Point Problem |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
Arithmetic Circuits and the Hadamard Product of Polynomials |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
The Remote Point Problem, Small Bias Space, and Expanding Generator Sets |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
On Lower Bounds for Constant Width Arithmetic Circuits |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Srikanth Srinivasan |
On the hardness of the noncommutative determinant |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar |
Arithmetic Circuits, Monomial Algebras and Finite Automata. |
MFCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Quantum Query Complexity of Multilinear Identity Testing. |
STACS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
On Lower Bounds for Constant Width Arithmetic Circuits. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar, Srikanth Srinivasan |
Arithmetic Circuits and the Hadamard Product of Polynomials. |
FSTTCS |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, T. C. Vijayaraghavan |
The Orbit problem is in the GapL Hierarchy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New results on Noncommutative and Commutative Polynomial Identity Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Quantum Query Complexity of Multilinear Identity Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Noncommutative Circuit Size. |
Electronic Colloquium on Computational Complexity (ECCC) |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Quantum Query Complexity of Multilinear Identity Testing |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New results on Noncommutative and Commutative Polynomial Identity Testing |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar |
Lattice Problems, Gauge Functions and Parameterized Algorithms |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur |
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das |
SZK Proofs for Black-Box Group Problems. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Johannes Köbler |
A Logspace Algorithm for Partial 2-Tree Canonization. |
CSR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, T. C. Vijayaraghavan |
The Orbit Problem Is in the GapL Hierarchy. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Pushkar S. Joglekar |
Algorithmic Problems for Metrics on Permutation Groups. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay, Srikanth Srinivasan |
New Results on Noncommutative and Commutative Polynomial Identity Testing. |
IEEE Conference on Computational Complexity |
2008 |
DBLP DOI BibTeX RDF |
randomized, polynomial time, deterministic, polynomial identity testing |
| 1 | Vikraman Arvind, Pushkar S. Joglekar |
Some Sieving Algorithms for Lattice Problems. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
The Ideal Membership Problem and Polynomial Identity Testing. |
Electronic Colloquium on Computational Complexity (ECCC) |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Christine T. Cheng, Nikhil R. Devanur |
On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Wolfgang Lindner |
Parameterized Learnability of k -Juntas and Related Problems. |
ALT |
2007 |
DBLP DOI BibTeX RDF |
Subject Classification Learning theory, computational complexity |
| 1 | Vikraman Arvind, Partha Mukhopadhyay |
The Monomial Ideal Membership Problem and Polynomial Identity Testing. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Johannes Köbler |
The Space Complexity of k -Tree Isomorphism. |
ISAAC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Sanjiva Prasad (eds.) |
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 27th International Conference, New Delhi, India, December 12-14, 2007, Proceedings |
FSTTCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
Graph Isomorphism is in SPP. |
Inf. Comput. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
A Polynomial Time Nilpotence Test for Galois Groups and Related Results |
CoRR |
2006 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das |
SZK Proofs for Black-Box Group Problems. |
CSR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
A Polynomial Time Nilpotence Test for Galois Groups and Related Results. |
MFCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler |
On Hypergraph and Graph Isomorphism with Bounded Color Classes. |
STACS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
The Complexity of Black-Box Ring Problems. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Bireswar Das, Partha Mukhopadhyay |
On Isomorphism and Canonization of Tournaments and Hypertournaments. |
ISAAC |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Isomorphism Testing: Perspective and Open Problems. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, T. C. Vijayaraghavan |
The Complexity of Solving Linear Equations over a Finite Ring. |
STACS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan |
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. |
IEEE Conference on Computational Complexity |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Solvable Group Isomorphism is (almost) in NP\cap coNP |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaraghavan |
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy. |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
On the Complexity of Computing Units in a Number Field. |
ANTS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, T. C. Vijayaraghavan |
Abelian Permutation Group Problems and Logspace Counting Classes. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Solvable Group Isomorphism. |
IEEE Conference on Computational Complexity |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
Upper Bounds on the Complexity of some Galois Theory Problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Eric Allender, Vikraman Arvind, Meena Mahajan |
Arithmetic Complexity, Kleene Closure, and Formal Power Series. |
Theory Comput. Syst. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
Upper Bounds on the Complexity of Some Galois Theory Problems. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Rainer Schuler |
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Venkatesh Raman |
Approximate Counting small subgraphs of bounded treewidth and related problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
Graph Isomorphism is in SPP |
Electronic Colloquium on Computational Complexity (ECCC) |
2002 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
The Query Complexity of Program Checking by Constant-Depth Circuits. |
Chicago J. Theor. Comput. Sci. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler |
New Lowness Results for ZPPNP and Other Complexity Classes. |
J. Comput. Syst. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Piyush P. Kurur |
Graph Isomorphism is in SPP. |
FOCS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Venkatesh Raman |
Approximation Algorithms for Some Parameterized Counting Problems. |
ISAAC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler |
On pseudorandomness and resource-bounded measure. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
A nonadaptive NC checker for permutation group intersection. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
Exact learning via teaching assistants. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
The counting complexity of group-definable languages. |
Theor. Comput. Sci. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Richard Beigel, Antoni Lozano |
The Complexity of Modular Graph Automorphism. |
SIAM J. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler |
Graph Isomorphism Is Low for ZPP(NP) and Other Lowness Results. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Martin Mundhenk, Jacobo Torán |
Nondeterministic Instance Complexity and Hard-to-Prove Tautologies. |
STACS |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Sparse Sets, Approximable Sets, and Parallel Queries to NP. |
Inf. Process. Lett. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Eric Allender, Vikraman Arvind, Meena Mahajan |
Arithmetic Complexity, Kleene Closure, and Formal Power Series |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler |
Graph Isomorphism is Low for ZPPNP and other Lowness results. |
Electronic Colloquium on Computational Complexity (ECCC) |
1999 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Sparse Sets, Approximable Sets, and Parallel Queries to NP. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
The Query Complexity of Program Checking by Constant-Depth Circuits. |
ISAAC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran |
The Query Complexity of Program Checking by Constant-Depth Circuits |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Jacobo Torán |
Sparse Sets, Approximable Sets, and Parallel Queries to NP |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, Richard Beigel, Antoni Lozano |
The Complexity of Modular Graph Automorphism. |
STACS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Ramaswamy Ramanujam (eds.) |
Foundations of Software Technology and Theoretical Computer Science, 18th Conference, Chennai, India, December 17-19, 1998, Proceedings |
FSTTCS |
1998 |
DBLP BibTeX RDF |
|
| 1 | Vikraman Arvind, N. V. Vinodchandran |
Solvable Black-Box Group Problems are Low for PP. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")