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 2016Show all

2 papers · 1 filter

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…

quant-ph2016

Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics

Hristo N. Djidjev, Georg Hahn, Susan M. Mniszewski +3

We study a graph partitioning problem motivated by the simulation of the physical movement of multi-body systems on an atomistic level, where the forces are calculated from a quant…

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

Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics

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