*Gaurav Sood*
is working towards his doctoral degree. He is interested in
Boolean function complexity, proof complexity, combinatorial
algorithms, and many other topics.

*Aditi Dudeja*
surveyed results on pebble games and bounds and
trade-offs for resolution proofs for her Master's
thesis, which she completed in July 2017.

*Anuj Tawari*
surveyed some recent results in the area of algebraic complexity for
his Master's thesis, which he completed in June 2014.
In Feb 2019, he defended his doctoral thesis, titled
Lower bounds for read-once and tropical formulas, which is
concerned with some lower bound
questions in algebraic complexity.

Currently, Anuj is a post-doctoral fellow at the Chennai Mathematical
Institute.

* **Anil Shukla*
surveyed results concerning lower bounds for resolution proofs for his
pre-doctoral project completed in July 2013. For his doctoral
dissertation, he has explored various proof systems for QBFs.
In Feb 2017, he defended his
doctoral dissertation, titled
*
On Proof Complexity for Quantified Boolean Formulas
*.

Currently, Anil is at the CSE Dept at IIT Ropar.

*Sankardeep Chakraborty*
surveyed results in the area of correlation bounds for his Master's
thesis, which he completed in July 2013.

*
Nitin Saurabh*
surveyed results in the area of algebraic complexity for his Master's
thesis, which he completed in July 2012. In Dec 2016, he defended his
doctoral dissertation, titled
* Analysis of Algebraic Complexity Classes and Boolean
Functions*.

Currently, Nitin is a post-doctoral fellow at Technion - Israel
Institute of Technology.

*
Karteek Sreenivasaiah*
surveyed lower bound techniques for Boolean circuits for his master's
thesis, which he completed in July 2010. In Jan 2015 he defended his
doctoral dissertation, titled
*On verifying proofs in constant depth, and polynomial identity
testing*.

Currently, Karteek is at the CSE Dept at IIT Hyderabad.

*
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 defended her
doctoral thesis, titled
* Complexity Analysis of Some Problems
in Planar Graphs, Bounded Tree-width Graphs and Planar Point Sets*,
in October 2010.

Currently, Prajakta is at the Chennai Mathematical Institute.

*
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
in the CSE dept at IIT Madras.

*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 at the CSE dept at IIT Bombay.

*
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 in the CSE dept at IIT Madras.