​
Login / Signup
Vivek B. Sardeshmukh
ORCID
Publication Activity (10 Years)
Years Active: 2014-2016
Publications (10 Years): 3
Top Topics
Randomized Algorithm
Maximum Weight
Spanning Tree
Worst Case
Top Venues
CoRR
PODC
FSTTCS
CSC
</>
Publications
</>
Sriram V. Pemmaraju
,
Vivek B. Sardeshmukh
Super-fast MST Algorithms in the Congested Clique using o(m) Messages.
CoRR
(2016)
Sriram V. Pemmaraju
,
Vivek B. Sardeshmukh
Super-Fast MST Algorithms in the Congested Clique Using o(m) Messages.
FSTTCS
(2016)
Hristo N. Djidjev
,
Georg Hahn
,
Susan M. Mniszewski
,
Christian F. A. Negre
,
Anders M. N. Niklasson
,
Vivek B. Sardeshmukh
Graph Partitioning Methods for Fast Parallel Quantum Molecular Dynamics.
CSC
(2016)
James W. Hegeman
,
Gopal Pandurangan
,
Sriram V. Pemmaraju
,
Vivek B. Sardeshmukh
,
Michele Scquizzato
Toward Optimal Bounds in the Congested Clique: Graph Connectivity and MST.
PODC
(2015)
Sriram V. Pemmaraju
,
Vivek B. Sardeshmukh
Minimum-weight Spanning Tree Construction in $O(\log \log \log n)$ Rounds on the Congested Clique.
CoRR
(2014)