Laxman Dhulipala

I am a fourth year PhD student in the Computer Science Department at Carnegie Mellon University. I am very fortunate to be advised by Guy Blelloch with whom I work on parallel graph algorithms.

I recently spent two enjoyable summers at Google.

In 2016 I organized a reading group on parallel algorithms.

Publications

Near-Optimal Massively Parallel Graph Connectivity
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Łącki, and Vahab Mirrokni
To appear in FOCS 2019
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees
Laxman Dhulipala, Guy Blelloch, and Julian Shun
PLDI 2019
Distinguished Paper Award

code
Massively Parallel Computation via Remote Memory Access
Soheil Behnezhad, Laxman Dhulipala, Hossein Esfandiari, Jakub Łącki, Vahab Mirrokni, and Warren Schudy
SPAA 2019
Parallel Batch-Dynamic Graph Connectivity
Umut Acar, Daniel Anderson, Guy Blelloch, and Laxman Dhulipala
SPAA 2019
Batch Parallel Euler-Tour Trees
Thomas Tseng, Laxman Dhulipala and Guy Blelloch
ALENEX 2019
code
Theoretically Efficient Parallel Algorithms Can Be Fast and Scalable
Laxman Dhulipala, Guy Blelloch and Julian Shun
SPAA 2018
Best Paper Award

code
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing
Laxman Dhulipala, Guy Blelloch and Julian Shun
SPAA 2017
code
Compressing Graphs and Indexes with Recursive Graph Bisection
Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Sergey Pupyrev and Alon Shalita
KDD 2016
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+
Julian Shun, Laxman Dhulipala and Guy Blelloch
DCC 2015
code
A simple and practical linear-work parallel algorithm for connectivity
Julian Shun, Laxman Dhulipala and Guy Blelloch
SPAA 2014
code

Notes

Introduction to Parallel Algorithms (draft)
Guy Blelloch and Laxman Dhulipala