activity
20162026
most citedCompressing Graphs and Indexes with Recursive Graph Bisection

112 citations · 370 across the 54 of their papers we have counts for

collaborators
Showing 2019Show all

7 papers · 1 filter

cs.PL2019★ 2 cited

Optimizing Ordered Graph Algorithms with GraphIt

Yunming Zhang, Ajay Brahmakshatriya, Xinyi Chen +4

Many graph problems can be solved using ordered parallel graph algorithms that achieve significant speedup over their unordered counterparts by reducing redundant work. This paper…

cs.DC2019★ 2 cited

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs

Laxman Dhulipala, Charlie McGuffey, Hongbo Kang +4

Non-volatile main memory (NVRAM) technologies provide an attractive set of features for large-scale graph analytics, including byte-addressability, low idle power, and improved mem…

cs.DS2019★ 1 cited

Near-Optimal Massively Parallel Graph Connectivity

Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari +2

Identifying the connected components of a graph, apart from being a fundamental problem with countless applications, is a key primitive for many other algorithms. In this paper, we…

cs.DS2019★ 1 cited

Parallel Batch-Dynamic Graphs: Algorithms and Lower Bounds

David Durfee, Laxman Dhulipala, Janardhan Kulkarni +3

In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In thi…

cs.DC2019

Massively Parallel Computation via Remote Memory Access

Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari +3

We introduce the Adaptive Massively Parallel Computation (AMPC) model, which is an extension of the Massively Parallel Computation (MPC) model. At a high level, the AMPC model stre…

cs.DC2019

Low-Latency Graph Streaming Using Compressed Purely-Functional Trees

Laxman Dhulipala, Julian Shun, Guy Blelloch

Due to the dynamic nature of real-world graphs, there has been a growing interest in the graph-streaming setting where a continuous stream of graph updates is mixed with arbitrary…

cs.DS2019★ 45 cited

Parallel Batch-Dynamic Graph Connectivity

Umut A. Acar, Daniel Anderson, Guy E. Blelloch +1

In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. Th…