Laxman DhulipalaView profile
Assistant Professor
Laxman Dhulipala is an Assistant Professor in the Department of Computer Science at the University of Maryland, College Park, and a research scientist at Google Research. He holds a Ph.D. from Carnegie Mellon University, advised by Guy Blelloch, and was a postdoc at MIT under Julian Shun. His research focuses on scalable parallel algorithms, high-performance graph processing, and models of computation for emerging hardware. Dhulipala has contributed to parallel graph clustering, dynamic graph algorithms, and practical implementations of parallel computational geometry. Affiliations: University of Maryland, College Park (Department of Computer Science) UMIACS (University of Maryland Institute for Advanced Computer Studies) Google Research (Graph Mining team) Education: Ph.D. in Computer Science, Carnegie Mellon University (2020) B.S. in Computer Science, Carnegie Mellon University (2014), with University Honors and Phi Beta Kappa. Research Interests: Efficient parallel algorithms for static, dynamic, and streaming graphs; parallel clustering techniques; models of computation for emerging hardware; scalable static/dynamic/streaming graph algorithms. His work bridges theory and practice, emphasizing algorithm design, system implementation, and performance optimization. Awards and Honors: 2024 ACM Paris Kanellakis Theory and Practice Award 2023 Allen Newell Award for Research Excellence 2022 Best Paper at SPAA 2019 Distinguished Paper at PLDI 2018 Best Paper at SPAA Grants: NSF SHF: REU Site (Co-PI) NSF SHF: Scalable Graph-Based Clustering (PI) NSF SATC: Differential Privacy in Graph Mining (Co-PI) Teaching: Recent courses include CMSC858N (Scalable Parallel Algorithms), CMSC451 (Design and Analysis of Algorithms), and workshops on parallel computing and graph algorithms. Labs and Teams: He leads research in parallel graph algorithms and systems at the University of Maryland, collaborating with Google Research and MIT on projects like the Graph-Based Benchmark Suite (GBBS) and ParGeo library.











