Department of Computer Science, Dartmouth College, Hanover, NH 03755, USA
Lab: ECSC 115
I am a Lecturer in the Department of Computer Science at Dartmouth College for the Summer term. I am teaching Discrete Mathematics in Computer Science (CS30). In Fall 2022, I shall be joining DIMACS at Rutgers University as a Simons Postdoctoral Leader!
I recently completed my Ph.D. in Computer Science at Dartmouth, where I was fortunate to be advised by Amit Chakrabarti. My thesis is titled Space-Efficient Algorithms and Verification Schemes for Graph Streams.
My research interests lie broadly in Theoretical Computer Science, especially in graph algorithms. I'm currently working on designing efficient graph algorithms in memory-restricted settings such as data streaming and stream verification, as well as in the dynamic setting. I'm also interested in communication complexity, FPT algorithms, graph-query/sublinear-time algorithms, and combinatorial graph theory.
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 on FPT Algorithms Using Algebraic Techniques was advised by G. Philip.
Here's a copy of my CV (as of June 2022).
A New Dynamic Algorithm for Densest Subhypergraphs TheWebConf (formerly WWW) 2022
Suman K. Bera, Sayan Bhattacharya, Jayesh Choudhari, Prantar Ghosh
Nominated for Best Paper Award
[full version (arXiv)] [conference version] [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 am teaching Discrete Mathematics in Computer Science (CS30) at Dartmouth College.
Discrete Mathematics Jan–Apr 2017
Parameterized and Exact Algorithms Aug–Nov 2016
Discrete Mathematics Jan–Apr 2016
I have been an external reviewer for several conferences including FOCS, SODA, SOSA, ICALP, APPROX, RANDOM, ESA, and ITCS.
Since the start of my time at Dartmouth, I have been a co-organizer of the Theory Reading Group (TRG) in the CS department.
Feel free to email me if you want to give a talk at our TRG!