Vivek Sardeshmukh

activity

20122018

most citedTask-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning

6 citations · 15 across the 6 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.DC2014★ 2 cited

Minimum-weight Spanning Tree Construction in $O (lo g lo g lo g n)$ Rounds on the Congested Clique

Sriram V. Pemmaraju, Vivek B. Sardeshmukh

This paper considers the \textit{minimum spanning tree (MST)} problem in the Congested Clique model and presents an algorithm that runs in $O (lo g lo g lo g n)$ rounds, with high p…

cs.DC2014★ 3 cited

Near-Constant-Time Distributed Algorithms on a Congested Clique

James W. Hegeman, Sriram V. Pemmaraju, Vivek B. Sardeshmukh

This paper presents constant-time and near-constant-time distributed algorithms for a variety of problems in the congested clique model. We show how to compute a 3-ruling set in ex…

Minimum-weight Spanning Tree Construction in O(logloglogn) Rounds on the Congested Clique

Near-Constant-Time Distributed Algorithms on a Congested Clique

Minimum-weight Spanning Tree Construction in $O (lo g lo g lo g n)$ Rounds on the Congested Clique