( en | de | ru )

 

Disambiguation of "Arvind, Vikraman"

Author of the publication

copydeleteadd this publication to your clipboard
The Space Complexity of k -Tree Isomorphism.

, , and . ISAAC, volume 4835 of Lecture Notes in Computer Science, page 822-833. Springer, (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Arvind Batra

Arvind Agarwal

Arvind Krishnamurthy

Arvind Dev

Arvind Krishnaswamy

 

Other publications of authors with the same name

On Computing the Distinguishing Numbers of Planar Graphs and Beyond: a Counting Approach, , and . CoRR, (2007)The Remote Point Problem, Small Bias Space, and Expanding Generator Sets, and . CoRR, (2009)The Complexity of Modular Graph Automorphism., , and . SIAM J. Comput., 30 (4): 1299-1320 (2000)The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem., and . ISAAC, volume 4288 of Lecture Notes in Computer Science, page 233-242. Springer, (2006)Arithmetic Circuits, Monomial Algebras and Finite Automata., and . MFCS, volume 5734 of Lecture Notes in Computer Science, page 78-89. Springer, (2009)Sparse Sets, Approximable Sets, and Parallel Queries to NP., and . STACS, volume 1563 of Lecture Notes in Computer Science, page 281-290. Springer, (1999)Arithmetic Complexity, Kleene Closure, and Formal Power Series., , and . Theory Comput. Syst., 36 (4): 303-328 (2003)Some Sieving Algorithms for Lattice Problems., and . FSTTCS, volume 2 of LIPIcs, page 25-36. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2008)Multiplicity Equivalence Testing of Automata over Partially Commutative Monoids., , , and . CoRR, (2020)Isomorphism testing of Boolean functions computable by constant-depth circuits., and . Inf. Comput., (2014)