Sourav Chakraborty

Sourav Chakraborty is a Professor in the Advanced Computing and Microelectronics Unit (ACMU) of the Computer and Communication Sciences Division at the Indian Statistical Institute (ISI), Kolkata, India. He joined ISI in July 2018 after serving as faculty at Chennai Mathematical Institute from 2010-2018. Previously, he held postdoctoral positions at Centrum Wiskunde & Informatica (CWI) in Amsterdam and Technion in Israel.

Education:

• Ph.D. in Computer Science, University of Chicago (2008)
• M.S. in Computer Science, University of Chicago (2005)
• B.Sc. in Mathematics, Chennai Mathematical Institute (2003)

Research Focus: Professor Chakraborty specializes in Theoretical Computer Science with emphasis on classical and quantum complexity of Boolean functions, including sensitivity analysis, property testing, and quantum database search. His work extends to graph algorithms, electronic commerce mechanisms, and coding theory. His research explores fundamental questions in computational complexity through innovative mathematical frameworks.

Publication Trends: Recent work demonstrates a strong focus on property testing, sampling algorithms, and complexity theory, with significant contributions to streaming algorithms, Boolean function analysis, and quantum query complexity. His publications frequently appear in top theoretical computer science venues and exhibit consistent innovation in algorithm design and complexity boundaries.

Awards & Honors:

• Praise from Donald E. Knuth for streaming algorithms research
• Inclusion in Oded Goldreich's 'my choices' list for Conditional Sampling and Huge-Object Model work
• Chakraborty's function named in his honor for Sensitivity Conjecture contributions

Academic Service: Teaches courses in discrete mathematics and theoretical computer science, with detailed course materials available through institutional pages. Organized workshops including the 2020 Workshop on Sensitivity and Query Complexity at ISI.