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 2016 · cs.DCShow all

1 paper · 2 filters

cs.DC2016★ 4 cited

Super-fast MST Algorithms in the Congested Clique using $o (m)$ Messages

Sriram V. Pemmaraju, Vivek B. Sardeshmukh

In a sequence of recent results (PODC 2015 and PODC 2016), the running time of the fastest algorithm for the \emph{minimum spanning tree (MST)} problem in the \emph{Congested Cliqu…

Super-fast MST Algorithms in the Congested Clique using o(m) Messages

Super-fast MST Algorithms in the Congested Clique using $o (m)$ Messages