Prantar Ghosh (@prantarg) header
Prantar Ghosh (@prantarg) profile picture

Assistant Professor @tennesseetech | Research: Theoretical CS | Focus: Streaming Algorithms, Graph Algorithms | Other interests: food & travel

Cookeville, TN
Joined March 2011
Photo by Prantar Ghosh (@prantarg)Photo by Prantar Ghosh (@prantarg)Photo by Prantar Ghosh (@prantarg)
I'm excited to announce that I just started as a postdoctoral fellow @Georgetown hosted by @SuccinctJT! I look forward to working closely with Justin and others at Georgetown and also with my collaborators @DIMACSCenter, where I shall be a visitor for the next few months.
1
22
1,465
All speakers and talks have been finalized. The schedule for the workshop is now out. Register soon if you haven't already! Reminder: tomorrow is the last day for submitting posters. Hurry!
Workshop on Modern Techniques in Graph Algorithms @DIMACSCenter @RutgersU, June 12-15, 2023: sites.google.com/view/dimacs… Exciting tutorials, amazing speakers, cool posters, and more (check out the website for details)! Register for free! Now calling for posters! Spread the word!
3
9
1,458
Exactly! I'd be a postdoc for life if possible 😂
Being a postdoc is awesome - you get 50% of the salary and respect of an assistant professor, but have 0% of the responsibility. Great deal, IMO.
3
1
2
989
Workshop on Modern Techniques in Graph Algorithms @DIMACSCenter @RutgersU, June 12-15, 2023: sites.google.com/view/dimacs… Exciting tutorials, amazing speakers, cool posters, and more (check out the website for details)! Register for free! Now calling for posters! Spread the word!
1
3
1
17
3,096
When you get to learn more about a topic while teaching it, that's the best! 🙂
Parting gift from @prantarg who taught discrete math at #dartmouth before heading off to #DIMACS postdoc: a lovely proof (by a student, under exam conditions!) that I hadn't seen before.
Just paused working on Overleaf to send an email. Completed only the first sentence and hit Ctrl+Enter. Email Sent🥲🥲
3
Delighted to announce that I successfully defended my PhD thesis yesterday. Grateful to my advisor @amitc1 for his excellent guidance over the last 5 years. Thanks to my committee members, friends, and family who supported me and made this achievement possible.
2
24
I'm also excited to announce that I'll stay as a lecturer @dartmouth over the summer and teach Discrete Math. In the Fall, I'll join @DIMACSCenter as a Simons Postdoctoral Leader. I look forward to working closely with everyone there!
2
1
8
Pleased to know that our work "A New Dynamic Algorithm for Densest Subhypergraphs" was nominated for Best Paper Award @TheWebConf! It was among the top 11 out of 323 papers accepted from 1822 submissions!! Congrats to my coauthors @SumanKBera, Sayan Bhattacharya, and @jayeshc17!
3
1
32
Adjectives for a number that's on the lower side but not too low either? It's more than what "a few" implies but less than what "a significant number of" does. I feel it's best expressed by "non-trivially many," but not sure if it's acceptable in articles like, say, my thesis..🤔
1
Overleaf > New Project > Thesis And so it begins! :)
1
8
Ethiopia, 2022. 🥲
Friend of mine received this extraordinary mail
There's been a recent surge of interest in "adversarially robust" streaming. Here, an adaptive adversary continues the stream based on past outputs received. In a paper (arxiv.org/pdf/2109.11130.pdf, ITCS'22) with @amitc1 and Manuel Stoeckl, we study graph coloring in this model. 1/6
3
1
1
8
In standard streaming, Assadi, Chen, and Khanna (SODA19) obtained a Δ+1-coloring in ~O(n) space for n-node graphs with max-degree Δ. In contrast, we show that a robust algo must use (i) Ω(nΔ) space for O(Δ)-coloring and (ii) Ω(Δ²) colors for O(n) space. Why's it interesting? 2/6
1
I found this amazing!
Amit Sahai explains zero-knowledge proofs to 5 different people: a child, a teen, a college student, a grad student, and an expert. I love this idea, and apparently Wired has done it with various technical concepts. (h/t Divesh Aggarwal) youtube.com/watch?v=fOGdb1CT…
1
1