Graduate Students who worked / are working with Meena Mahajan

Jayalal Sarma worked on derandomization techniques for his M.Sc. project, titled Refining Randomness and Applications to Derandomization, which he completed in July 2004.
Towards a Ph.D., he worked on problems concerning circuits, algebraic structures/computations, and derandomization. He defended his doctoral thesis, titled Complexity Theoretic Aspects of Rank, Rigidity and Circuit Evaluation, in February 2009.
Currently, Jayalal is a post-doctoral fellow at Tsinghua University, Beijing.

Nutan Limaye worked on parallel computation techniques centred around LogCFL for her M.Sc. project, which she completed in June 2005.
Towards a PhD, Nutan worked on problems concerning circuits, logarithmic space, and context-free languages. She defended her doctoral thesis, titled Exploring LogCFL using Language Theory, in December 2009.
Currently, Nutan is a post-doctoral fellow at the Tata Institute of Fundamental Research, Mumbai.

B. V. Raghavendra Rao worked on problems concerning counting classes, arithmetic circuits, algebraic complexity, and the complexity of some isomorphism questions. He defended his doctoral thesis, titled A study of width bounded arithmetic circuits, and the complexity of matroid isomorphism, in March 2010.
Currently, Raghavendra is a post-doctoral fellow at Saarland University, Germany.

Prajakta Nimbhorkar worked on a variety of problems concerning planar graphs and planar layouts. A high point of her research, co-authored with many others, is a log-space algorithm for determining whether two planar graphs are isomorphic. She is also interested in circuits, randomness, and algebraic structures. She has submitted her doctoral thesis, titled Complexity Analysis of Some Problems in Planar Graphs, Bounded Tree-width Graphs and Planar Point Sets , in February 2010.

Karteek Sreenivasaiah is working on his master's thesis, surveying lower bound techniques for Boolean circuits.