Assistant Professor
Ph.D. (Computer Science, Massachusetts Institute of Technology, 2012)
M.Sc. (Computer Science, Massachusetts Institute of Technology, 2006)
B.Sc. (Computer Science & Physics, Minor: Mathematics, Massachusetts Institute of Technology, 2005)
660 17898

Research Areas

  • Algorithms & Theory
  • Artificial Intelligence

Research Interests

  • Algorithms for Big Data
  • Probability and Statistics
  • Property Testing
  • Complexity Theory and Coding Theory
  • Interaction between computation and physical systems


Arnab Bhattacharyya obtained his bachelor’s, master’s and doctoral degrees in computer science from the Massachusetts Institute of Technology. Subsequently, he was a postdoctoral associate at Princeton University and Rutgers University. Most recently, he had been an assistant professor and a Ramanujan Fellow at the Indian Institute of Science, Bangalore. Arnab’s research area is theoretical computer science and foundations of data science, in a broad sense. Specifically, he is interested in algorithms for problems involving high-dimensional data, statistics, coding theory, complexity theory, and algorithmic models for physical systems.

Current Projects

Selected Publications

Awards & Honours

Teaching (2020/2021)

  • CS5234: Combinatorial and Graph Algorithms
  • CS5330: Randomized Algorithms