Theoretical Computer Science, Data Management
Barna Saha's research interests span algorithm design and analysis, discrete optimization, probability, and foundational aspects of large scale data management. She particularly enjoys to work on problems of practical importance that can lead to development of new beautiful theory. Her dissertation research was on developing novel algorithms and probabilistic techniques for a class of resource allocation and scheduling problems. Currently, she is working on the interplay of algorithm design and formal language theory, and its vivid applications in data management and biology.
Barna Saha is an Assistant Professor in the College of Information and Computer Sciences at the University of Massachusetts Amherst. She received her Ph.D. in Computer Science from the University of Maryland College Park in August 2011. From August 2011 till July 2014, she was a research scientist at AT&T Shannon Laboratories. Barna received an M.Tech. in Computer Science and Engineering from the Indian Institute of Technology Kanpur and a B.E. in Computer Science and Engineering from Jadavpur University.
Barna Saha's works appear in top venues in theoretical computer science and databases. She has served as a committee member of conferences from both these areas and as a NSF panelist multiple times. Barna is a recipient of NSF CISE Research Initiation Award for her proposal on scalable dynamic programming, and a Simons Research Fellowship award from the Simons Institute at the University of California Berkley in 2015. Her work on probabilistic ranking won the best paper award at Very Large Databases Conference (VLDB) 2009, and the best of papers citation award at ICDE 2012 for her work on data quality. She was awarded a Dean's dissertation fellowship at the University of Maryland for excellence in dissertation research. She loves teaching and is also serving as a mentor for several women students in Computer Science through the CBDB Mentoring Network for Women of Color in Computing.