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 algorithms.

In 2018, I had a very enjoyable summer working with Jakub Łącki on clustering and related problems at Google Research (New York).

In 2017, I had a very enjoyable summer working with Zoya Svitkina on resource-allocation problems at Google Research (Mountain View).

I helped run a reading group on parallel algorithms from 2016-2017.

Publications

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 E. Blelloch (DCC 2015)
code
A simple and practical linear-work parallel algorithm for connectivity
Julian Shun, Laxman Dhulipala and Guy E. Blelloch (SPAA 2014)
code

Notes

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