Last (academic) year, I was a Simons Postdoctoral Leader at DIMACS, where I primarily worked with Sepehr Assadi. Prior to that, in May 2022, I completed my PhD in Computer Science at Dartmouth College, where I was fortunate to be advised by Amit Chakrabarti. Then I spent the summer of 2022 as a Lecturer in the Department of Computer Science at Dartmouth.
Before joining Dartmouth, I spent five wonderful years at Chennai Mathematical Institute (CMI), India, where I completed my M.Sc. in Computer Science in 2017 and B.Sc. in Mathematics and Computer Science in 2015. My Master's thesis was supervised by G. Philip.
My research interests lie broadly in Theoretical Computer Science, especially in graph algorithms. My dissertation work was on designing efficient graph algorithms in memory-restricted settings such as data streaming and stream verification. My thesis is titled Space-Efficient Algorithms and Verification Schemes for Graph Streams.
I have also worked on a variety of other areas over the years, and my research interests include dynamic graph algorithms, communication complexity, FPT algorithms, graph-query/sublinear-time algorithms, and combinatorial graph theory.
Here's a copy of my CV (as of September 2023).
A New Dynamic Algorithm for Densest Subhypergraphs TheWebConf (fka WWW) 2022
Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh
Nominated for Best Paper Award
[full version (arXiv)] [conference version] [talk] [slides]
Streaming Verification for Graph Problems: Optimal Tradeoffs and Nonlinear Sketches RANDOM 2020
Amit Chakrabarti, Prantar Ghosh, Justin Thaler
[full version (arXiv)] [ECCC] [conference version] [talk] [slides]
Streaming Verification of Graph Computations via Graph Structure RANDOM 2019
Amit Chakrabarti, Prantar Ghosh
[full version (ECCC)] [conference version] [conference slides] [talk (workshop at Simons Institute)] [workshop slides]
Theses and Technical Reports
Space-Efficient Algorithms and Verification Schemes for Graph Streams
Ph.D. Thesis, Dartmouth College, 2022
FPT Algorithms Using Algebraic Techniques
Master's Thesis, Chennai Mathematical Institute, 2017
In Summer 2022, I was the Instructor of CS30: Discrete Mathematics in Computer Science at Dartmouth College.
I taught a class of 30 undergraduate students and gave 27 lectures (3 per week, 65 mins each) in the course.
Discrete Mathematics Jan–Apr 2017
Parameterized and Exact Algorithms Aug–Nov 2016
Discrete Mathematics Jan–Apr 2016
I co-organized the DIMACS Workshop on Modern Techniques in Graph Algorithms in June 2023.
I have been an external reviewer for several conferences including STOC, FOCS, SODA, SOSA, ICALP, APPROX, RANDOM, ESA, and ITCS.
During my time at Dartmouth, I have been a co-organizer of the Theory Reading Group (TRG) in the CS department.