Diptarka CHAKRABORTY

Assistant Professor

  • PhD in Computer Scicence and Engineering from Indian Institute of Technology Kanpur, India in 2016

Dr. Diptarka CHAKRABORTY is an assistant professor in the Department of Computer Science. He obtained his PhD degree in Computer Science and Engineering from the Indian Institute of Technology Kanpur, India in 2016. After that, he spent two years at Charles University, Prague, Czech Republic as a post-doctoral fellow hosted by Prof. Michal Koucky, and then almost a year at Weizmann Institute of Science, Israel as a post-doctoral fellow hosted by Prof. Robert Krauthgamer. His research interests are in the areas of Theoretical Computer Science; more specifically, algorithms on large data set, streaming algorithms, string matching algorithms, graph algorithms, and data structures.

RESEARCH AREAS

Algorithms & Theory
  • Combinatorial Algorithms
  • Complexity Theory
  • Fault Tolerance & Robustness
  • Graph Theory & Algorithms
  • Learning Theory
  • Optimisation

RESEARCH INTERESTS

  • Theoretical Computer Science; more specifically, algorithms on large data set, streaming algorithms, string matching algorithms, graph algorithms and data structures

RESEARCH PROJECTS

Handling Massive Data under the Edit Metric: Clustering, Finding Median and Computational Hardness


Rank Aggregation: Fairness and Computational Challenges


Finding String Similarity: Approximation, Streaming and Pattern Matching


RESEARCH GROUPS

TEACHING INNOVATIONS

SELECTED PUBLICATIONS

  • Clustering Permutations: New Techniques with Streaming Applications; Diptarka Chakraborty, Debarati Das and Robert Krauthgamer; ITCS 2023
  • Fair Rank Aggregation; Diptarka Chakraborty, Syamantak Das, Arindam Khan and Aditya Subramanian; NeurIPS 2022
  • Approximating the Median under the Ulam Metric; Diptarka Chakraborty, Debarati Das and Robert Krauthgamer; SODA 2021
  • New Extremal bounds for Reachability and Strong-Connectivity Preservers under failures; Diptarka Chakrabortyand Keerti Choudhary; ICALP 2020 Track A
  • Approximating Edit Distance Within Constant Factor in Truly Sub-Quadratic Time; Diptarka Chakraborty, Debarati Das, Elazar Goldenberg, Michal Koucky and Michael Saks; FOCS 2018 (winner of best paper award)
  • Tight Cell Probe Bounds for Succinct Boolean Matrix-Vector Multiplication; Diptarka Chakraborty,Lior Kamma and Kasper Green Larsen; STOC 2018
  • Streaming Algorithms for Embedding and Computing Edit Distance in the Low Distance Regime; Diptarka Chakraborty,Elazar Goldenberg and Michal Koucky; STOC 2016

AWARDS & HONOURS

  • Best Paper Award at FOCS 2018

  • IBM Research India Outstanding Ph.D. Student Award 2015-16

MODULES TAUGHT

CS3230
Design and Analysis of Algorithms
CS5234
Algorithms at Scale