Prof. Sourav

Sourav Chakraborty is an Associate Professor in the Computer Science Department at the Chennai Mathematical Institute. He has been a faculty at the Chennai Mathematical institute since 2010. He obtained his Phd from the University of Chicago in 2008. He did his MS also from the University of Chicago and did his under-graduation from the Chennai Mathematical Institute. He was a postdoctoral fellow at the Technion, Israel Institute of Technology, Haifa, Israel from 2008 to 2009 and at the Centrum Wiskunde Informatica (CWI), Amsterdam from 2009 to 2010. He has also been visiting faculty at the University of California, San Diego and Rice University, Houston. His area of research is algorithms and complexity. In particular he has done research in the classical and quantum complexity of Boolean functions (including property testing, sensitivity and block sensitivity of Boolean functions and quantum database search), in electronic commerce, in graph algorithms and in coding theory. He has over 30 papers in various international Journals and conferences. He has taught a variety of courses (both at the undergraduate level and advanced level) in Chennai Mathematical Institute and various other institute in India and abroad. In particular he has taught Discrete Mathematics for the undergraduates and masters in Chennai Mathematical Institute and also taught both the basic and advanced undergraduate level discrete mathematics course at University of California, San Diego.