Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Vikraman
Last name:	Arvind
DBLP:	a/VikramanArvind
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 10 of 135  

Select a publication
Show	Title	Venue	Rating	Date
	Journal article Vikraman Arvind. The Parameterized Complexity of some Permutation Group Problems	CoRR 2013, Volume 0	(0)	2013
	Conference paper Vikraman Arvind, Yadu Vasudev. Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits.	Language and Automata Theory and Applications - 6th International Conference, LATA 2012, A Coruña, Spain, March 5-9, 2012. Proceedings 2012	(0)	2012
	Conference paper Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar. Erd?s-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs.	LATIN 2012: Theoretical Informatics - 10th Latin American Symposium, Arequipa, Peru, April 16-20, 2012. Proceedings 2012	(0)	2012
	Journal article Vikraman Arvind, Bireswar Das, Johannes Köbler, Sebastian Kuhnert. The isomorphism problem for k-trees is complete for logspace.	Inf. Comput. 2012, Volume 217	(0)	2012
	Conference paper Vikraman Arvind, Johannes Köbler, Sebastian Kuhnert, Yadu Vasudev. Approximate Graph Isomorphism.	Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings 2012	(0)	2012
	Conference paper Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev. Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.	Mathematical Foundations of Computer Science 2012 - 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012. Proceedings 2012	(0)	2012
	Conference paper Vikraman Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar, Yadu Vasudev. Near-Optimal Expanding Generating Sets for Solvable Permutation Groups	CoRR 2012, Volume 0	(0)	2012
	Conference paper Vikraman Arvind, Sebastian Kuhnert, Johannes Köbler, Yadu Vasudev. Approximate Graph Isomorphism.	Electronic Colloquium on Computational Complexity (ECCC) 2012, Volume 19	(0)	2012
	Conference paper Vikraman Arvind, Piyush P. Kurur. Testing nilpotence of galois groups in polynomial time.	ACM Transactions on Algorithms 2012, Volume 8	(0)	2012
	Journal article Vikraman Arvind, T. C. Vijayaraghavan. The orbit problem is in the GapL hierarchy.	J. Comb. Optim. 2011, Volume 21	(0)	2011

Show item 1 to 10 of 135  

Your query returned 135 matches in the database.