Yadu Vasudev Senior Research Fellow Theoretical Computer Science The Institute of Mathematical Sciences, Chennai I am currently in my sixth year, working under Prof V.Arvind. My interests are in Complexity theory, more specifically isomorphism testing of Boolean functions and graphs, Boolean and arithmetic circuit complexity and pseudorandomness. |

110,New Building

The Institute of Mathematical Sciences

Taramani, Chennai-600113

Phone : +91-44-22543110 E-Mail :

**On the Isomorphism Problem for Decision Trees and Decision Lists.**

*with V. Arvind, Johannes Kobler, Sebastian Kuhnert, Gaurav Rattan.*

19th International Symposium of the Foundations of Computation Theory, FCT 2013.

**Approximate Graph Isomorphism.**

*with V. Arvind, Johannes Kobler, Sebastian Kuhnert.*

37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012

**Near-Optimal Expanding Generator Sets for Solvable Permutation Groups.**

*with V. Arvind, Partha Mukhopadhyay, Prajakta Nimbhorkar.*

37th International Symposium on Mathematical Foundations of Computer Science, MFCS 2012

**Isomorphism Testing of Boolean Functions Computable by Constant-Depth Circuits.**

*with V. Arvind.*

6th International Conference on Languages and Automata Theory and Applications, LATA 2012.

**The Partial Derivative Method in Arithmetic Circuit Complexity**

Master's Thesis, 2010

Advisor: Prof. V. Arvind