Mrinal Kumar is a Ph.D. student at Rutgers University. He received his B.Tech. in computer science from the Indian Institute of Technology, Madras. Mrinal’s research interests are in complexity theory, especially in lower bounds for arithmetic circuits. Over the last few years, he has made significant contributions to our understanding of “the method of shifted partial derivatives,” and has used this to prove long-elusive lower bounds on low-depth arithmetic circuit complexity. Mrinal also has interests in pseudorandomness and explicit constructions, and has made advances on polynomial identity testing and on “indexing” problems.