Soham Nandy
1 indexed paper
Recent (6 mo)
1With code
0Influential cites
0Benchmarked
0Publications per year
126
Top categories
Distributed×1Algorithms×1
Frequent co-authors
Research Timeline
2026
Fully Dynamic Rooted Spanning Tree on GPU
This paper presents four novel parallel algorithms for maintaining a rooted spanning forest in dynamic graphs, achieving a throughput of 2 million insertions and 1.4 million deletions per second.
Highlighted terms show continued research focus across papers