Guy Blelloch Professor Website ORCiD Office 9211 Gates and Hillman Centers Email gb1y@andrew.cmu.edu Phone (412) 268-6245 Department Computer Science Department Administrative Support Person Charlotte Yano Research Interests Programming Languages Theory Algorithms and Complexity Advisees Andrew Brady André Cesar Costa Zak Kent Renfei Zhou CSD Courses Taught 15210 - Fall, 2025 15210 - Fall, 2024 15852 - Spring, 2024 Research Statement My main research interest is in the interaction between algorithms and languages, mostly in the context of parallel computing, and has consisted of both theoretical and experimental work. As programming languages become higher level, implementations become more complex, and parallelism becomes pervasive, users are naturally becoming more removed from the hardware and its costs. Rather than trying to bring programmers down to the level of the machine to understand and get good performance, however, I believe that we should be trying to bring languages and cost models up to the level of the programmer. My research therefore centers around questions of how to model costs (e.g. time and space) for very-high level programming constructs (e.g. dynamic parallelism, futures, garbage collection), of how to design systems so these costs have meaning, and of how to make use of these features in effective algorithms design. My recent work includes work on the PSCICO project with Gary Miller, Bob Harper and Peter Lee. Here we are looking at how to use very-high level programming constructs in geometric and scientific algorithms. We hope this project will give guidance to future language design, and will identify new ways of thinking about algorithm implementation. I also work on applied algorithms, parallel garbage collection, parallel scheduling, efficient parallel algorithms, and continue to work, to some extent, on the NESL programming language, a parallel language that my students and I developed in the early 90s. Publications Conference CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor Search 2025 131-143 Manohar MD, Wei Y, Blelloch GE Journal Article Fast and fair randomized wait-free locks 2025 • Distributed Computing • 38(1):51-72 Ben-David N, Blelloch GE Conference Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications 2025 350-366 Zhao Y, Kang H, Gu Y, Blelloch GE, Dhulipala L, McGuffey C, Gibbons PB Conference Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments 2025 525-539 Ikram H, Brady A, Anderson D, Blelloch GE Conference Parallel Batch-Dynamic Maximal Matching with Constant Work per Update 2025 429-442 Blelloch GE, Brady AC
Conference CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor Search 2025 131-143 Manohar MD, Wei Y, Blelloch GE
Journal Article Fast and fair randomized wait-free locks 2025 • Distributed Computing • 38(1):51-72 Ben-David N, Blelloch GE
Conference Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications 2025 350-366 Zhao Y, Kang H, Gu Y, Blelloch GE, Dhulipala L, McGuffey C, Gibbons PB
Conference Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments 2025 525-539 Ikram H, Brady A, Anderson D, Blelloch GE
Conference Parallel Batch-Dynamic Maximal Matching with Constant Work per Update 2025 429-442 Blelloch GE, Brady AC
