About the Authors
Hervé Fournier
Institut de Mathématiques de Jussieu-Paris Rive Gauche
Université Paris Diderot, France
Hervé Fournier obtained his Ph.D. at ENS Lyon under the supervision of Pascal Koiran. His interests include algebraic complexity and its connections to computational geometry.
Nutan Limaye\footnotemark[1]
Nutan Limaye
Department of Computer Science and Engineering
IIT Bombay, Mumbai, India
Nutan Limaye graduated from The Institute of Mathematical Sciences, Chennai, India, in 2009; her advisor was Meena Mahajan. Her thesis focused on the interconnection between language classes and complexity classes. She is interested in Boolean and arithmetic circuit complexity and graph algorithms. She likes all things Japanese and has been trying to learn Japanese for the past year.
Meena Mahajan\footnotemark[1]
Meena Mahajan
The Institute of Mathematical Sciences, Chennai, India
Meena Mahajan is a professor in the theoretical computer science group at the Institute of Mathematical Sciences, Chennai, India, reaching there by way of education at the IITs at Mumbai and Chennai. At work, she researches questions concerning computational complexity. As recreation, she loves solving jigsaw puzzles (creating order out of disorder), and also solving combinatorial puzzles, which crop up in real-life situations far oftener than one may think.
Srikanth Srinivasan\footnotemark[1]
Srikanth Srinivasan
Department of Mathematics
IIT Bombay, Mumbai, India
Srikanth Srinivasan got his undergraduate degree from the Indian Institute of Technology Madras, where his interest in the theory side of CS was piqued under the tutelage of N. S. Narayanswamy. Subsequently, he obtained his Ph.D. from The Institute of Mathematical Sciences in 2011; his advisor was V. Arvind. His research interests span all of TCS (in theory), but in practice are limited to circuit complexity, derandomization, and related areas of mathematics. He enjoys running and pretending to play badminton.