Assistant Professor @tennesseetech | Research: Theoretical CS | Focus: Streaming Algorithms, Graph Algorithms | Other interests: food & travel
Cookeville, TN
Joined March 2011
- Tweets33
- Following240
- Followers216
- Likes143
Prantar Ghosh retweeted
Major breakthrough in graph streaming arxiv.org/abs/2607.14656 - the naive greedy matching algorithm is optimal! This resolves a huge open problem in this area (and other problems too). Big congrats to the authors: Sepehr Assadi, Max Jiang, Mars Xiang!
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.
The videos are also linked to the respective talk titles in the program here: sites.google.com/view/dimacs…
Have fun (re)watching them!
Most video recordings of our workshop (Modern Techniques on Graph Algorithms: sites.google.com/view/dimacs…) are online now at youtube.com/playlist?list=PL…. Thanks to all speakers and participants for making it a success!
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!
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!
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🥲🥲
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.
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!
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!
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..🤔
Prantar Ghosh retweeted
Surely, Wimbledon banned itself when Britain invaded Iraq, Afghanistan, and Libya. 🤔
NEWS: Russian tennis players will be barred from competing at Wimbledon in June, a decision that will prevent current world No. 2 @DaniilMedwed from playing in the season’s third Grand Slam.
sportico.com/leagues/tennis/…
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. We give a Δ³-coloring robust algo in ~O(n) space. Coupled with results of a parallel work (Assadi, Chen, Sun, ArXiv '21), this shows the first double separation for a streaming problem (colors needed for ~O(n) space)
Standard: Δ+1
Robust: poly(Δ)
Deterministic: exp(Δ^O(1))
5/6
For more details about the results, background, and our techniques, check out my talk for ITCS! youtu.be/mL0qP6Ld-kM
For questions and discussions, catch the live talk by Manuel at ITCS Session 12 on Feb 1!
ITCS starts tomorrow. Registration's free! simons.berkeley.edu/forms/it…
6/6
