6 citations · 15 across the 6 of their papers we have counts for
6 papers
Task-based Parallel Computation of the Density Matrix in Quantum-based Molecular Dynamics using Graph Partitioning
Purnima Ghale, Matthew P. Kroonblawd, Susan M. Mniszewski +6
Quantum-based molecular dynamics (QMD) is a highly accurate and transferable method for material science simulations. However, the time scales and system sizes accessible to QMD ar…
Super-fast MST Algorithms in the Congested Clique using 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…
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…
Minimum-weight Spanning Tree Construction in 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 rounds, with high p…
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…
On the Analysis of a Label Propagation Algorithm for Community Detection
Kishore Kothapalli, Sriram V. Pemmaraju, Vivek Sardeshmukh
This paper initiates formal analysis of a simple, distributed algorithm for community detection on networks. We analyze an algorithm that we call \textsc{Max-LPA}, both in terms of…