Web Reference: Aug 6, 2019 · In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. Our techniques combine a new graph contraction technique, an independent random sample extractor from correlated samples, as well as distributed data structures supporting parallel updates and queries in batches. This thesis contributes to the burgeoning field of batch-dynamic parallel algorithms by presenting parallel batch-dynamic graph algorithms for coreness decomposition and spanners, as well as a number of other related problems.
YouTube Excerpt: Julian Shun (MIT) https://simons.berkeley.edu/talks/julian-shun-mit-2023-09-22
Information Profile Overview
Parallel Batch Dynamic Graph Algorithms - Latest Information & Updates 2026 Information & Biography
Details: $8M - $20M
Salary & Income Sources
Career Highlights & Achievements
Assets, Properties & Investments
This section covers known assets, real estate holdings, luxury vehicles, and investment portfolios. Data is compiled from public records, financial disclosures, and verified media reports.
Last Updated: April 3, 2026
Information Outlook & Future Earnings
Disclaimer: Disclaimer: Information provided here is based on publicly available data, media reports, and online sources. Actual details may vary.