Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Tidjani Négadi
Daniel P. Kennedy
Lukas Edman
Barbara Aquilani
Yonglin Hao
Federico Formenti
Maximilian Dürr
Jhonathan Pinzon
Liangliang Shang
Chen Ma
Home
/
Author
/
V. ARVIND
Author Info
Open Visualization
Name
Affiliation
Papers
V. ARVIND
The Institute of Mathematical Sciences, Chennai 600 113, India
9
Collaborators
Citations
PageRank
9
52
4.34
Referers
Referees
References
72
196
163
Search Limit
100
196
Publications (9 rows)
Collaborators (9 rows)
Referers (72 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Comments on Arithmetic Complexity, Kleene Closure, and Formal Power Series
0
0.34
2013
The isomorphism problem for k-trees is complete for logspace
5
0.42
2012
Canonizing hypergraphs under abelian group action
1
0.36
2011
New Results on Noncommutative and Commutative Polynomial Identity Testing
17
0.66
2010
Parameterized learnability of juntas
3
0.37
2009
The space complexity of k-tree isomorphism
7
0.50
2007
The complexity of quasigroup isomorphism and the minimum generating set problem
1
0.37
2006
On hypergraph and graph isomorphism with bounded color classes
5
0.43
2006
Arithmetic Complexity, Kleene Closure, and Formal Power Series
13
0.90
1999
1