CIS: A Massively Concurrent Rule-Based System. - Guy E. Blelloch (AAAI, 1986)

Network Learning on the Connection Machine. - Guy E. Blelloch; Charles R. Rosenberg (IJCAI, 1987)

Four Vector-Matrix Primitives. - Ajit Agrawal; Guy E. Blelloch; Robert L. Krawitz; C. A. Phillips (SPAA, 1989)

Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine. - James J. Little; Guy E. Blelloch; Todd A. Cass (IEEE Trans. Pattern Anal. Mach. Intell., 1989)

Scans as Primitive Parallel Operations. - Guy E. Blelloch (IEEE Trans. Computers, 1989)

Vector Models for Data-Parallel Computing - Guy E. Blelloch (MIT Press, 1990)

Scan primitives for vector computers. - Siddhartha Chatterjee; Guy E. Blelloch; Marco Zagha (SC, 1990)

Compiling Collection-Oriented Languages onto Massively Parallel Computers. - Guy E. Blelloch; Gary Sabot (J. Parallel Distributed Comput., 1990)

Size and Access Inference for Data-Parallel Programs. - Siddhartha Chatterjee; Guy E. Blelloch; Allan L. Fisher (PLDI, 1991)

Radix sort for vector multiprocessors. - Marco Zagha; Guy E. Blelloch (SC, 1991)

Collection-oriented languages. - Jay Sipelstein; Guy E. Blelloch (Proc. IEEE, 1991)

A practical comparison of N-body algorithms. - Guy E. Blelloch; Girija J. Narlikar (Parallel Algorithms, 1994)

Parallel Solutions to Geometric Problems in the Scan Model of Computation. - Guy E. Blelloch; James J. Little (J. Comput. Syst. Sci., 1994)

Implementation of a Portable Nested Data-Parallel Language. - Guy E. Blelloch; Jonathan C. Hardwick; Jay Sipelstein; Marco Zagha; Siddhartha Chatterjee (J. Parallel Distributed Comput., 1994)

Parallelism in Sequential Functional Languages. - Guy E. Blelloch; John Greiner (FPCA, 1995)

Solving Linear Recurrences with Loop Raking. - Guy E. Blelloch; Siddhartha Chatterjee; Marco Zagha (J. Parallel Distributed Comput., 1995)

Developing a Practical Projection-Based Parallel Delaunay Algorithm. - Guy E. Blelloch; Gary L. Miller; Dafna Talmor (SCG, 1996)

A Provable Time and Space Efficient Implementation of NESL. - Guy E. Blelloch; John Greiner (ICFP, 1996)

Programming Parallel Algorithms. - Guy E. Blelloch (Commun. ACM, 1996)

A Comparison of Sorting Algorithms for the Connection Machine CM-2. - Guy E. Blelloch; Charles E. Leiserson; Bruce M. Maggs; C. Greg Plaxton; Stephen J. Smith; Marco Zagha (Commun. ACM, 1996)

Parallel Algorithms. - Guy E. Blelloch; Bruce M. Maggs (ACM Comput. Surv., 1996)

Parallel Algorithms. - Guy E. Blelloch; Bruce M. Maggs (The Computer Science and Engineering Handbook, 1997)

Space-Efficient Implementation of Nested Parallelism. - Girija J. Narlikar; Guy E. Blelloch (PPoPP, 1997)

Space-Efficient Scheduling of Parallelism with Synchronization Variables. - Guy E. Blelloch; Phillip B. Gibbons; Girija J. Narlikar; Yossi Matias (SPAA, 1997)

Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. - Guy E. Blelloch; Phillip B. Gibbons; Yossi Matias; Marco Zagha (IEEE Trans. Parallel Distributed Syst., 1997)

Pthreads for Dynamic and Irregular Parallelism. - Girija J. Narlikar; Guy E. Blelloch (SC, 1998)

Fast Set Operations Using Treaps. - Guy E. Blelloch; Margaret Reid-Miller (SPAA, 1998)

An Experimental Analysis of Parallel Sorting Algorithms. - Guy E. Blelloch; Charles E. Leiserson (Theory Comput. Syst., 1998)

Parallel Algorithms. - Guy E. Blelloch; Bruce M. Maggs (Algorithms and Theory of Computation Handbook, 1999)

On Bounding Time and Space for Multiprocessor Garbage Collection. - Guy E. Blelloch; Perry Cheng (PLDI, 1999)

On bounding time and space for multiprocessor garbage collection (with retrospective) - Guy E. Blelloch; Perry Cheng (Best of PLDI, 1999)

Design and Implementation of a Practical Parallel Delaunay Algorithm. - Guy E. Blelloch; Jonathan C. Hardwick; Gary L. Miller; Dafna Talmor (Algorithmica, 1999)

Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. - Guy E. Blelloch; Phillip B. Gibbons; Yossi Matias (J. ACM, 1999)

Pipelining with Futures. - Guy E. Blelloch; Margaret Reid-Miller (Theory Comput. Syst., 1999)

A Provably Time-Efficient Parallel Implementation of Full Speculation. - John Greiner; Guy E. Blelloch (ACM Trans. Program. Lang. Syst., 1999)

Space-Efficient Scheduling of Nested Parallelism. - Girija J. Narlikar; Guy E. Blelloch (ACM Trans. Program. Lang. Syst., 1999)

A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces. - James F. Antaki; Guy E. Blelloch; Omar Ghattas; Ivan Malcevic; Gary L. Miller; Noel Walkington (SC, 2000)

A Parallel, Real-Time Garbage Collector. - Perry Cheng; Guy E. Blelloch (PLDI, 2001)

Room synchronizations. - Guy E. Blelloch; Perry Cheng; Phillip B. Gibbons (SPAA, 2001)

Persistent triangulations Journal of Functional Programming. - Guy E. Blelloch; Hal Burch; Karl Crary; Robert Harper 001; Gary L. Miller; Noel Walkington (J. Funct. Program., 2001)

Index Compression through Document Reordering. - Daniel K. Blandford; Guy E. Blelloch (DCC, 2002)

The Data Locality of Work Stealing. - Umut A. Acar; Guy E. Blelloch; Robert D. Blumofe (Theory Comput. Syst., 2002)

Selective memoization. - Umut A. Acar; Guy E. Blelloch; Robert Harper 001 (POPL, 2003)

Compact representations of separable graphs. - Daniel K. Blandford; Guy E. Blelloch; Ian A. Kash (SODA, 2003)

Space-efficient finger search on degree-balanced search trees. - Guy E. Blelloch; Bruce M. Maggs; Shan Leung Maverick Woo (SODA, 2003)

Automatic Generation of Staged Geometric Predicates. - Aleksandar Nanevski; Guy E. Blelloch; Robert Harper 001 (High. Order Symb. Comput., 2003)

Scalable Room Synchronizations. - Guy E. Blelloch; Perry Cheng; Phillip B. Gibbons (Theory Comput. Syst., 2003)

An Experimental Analysis of a Compact Graph Representation. - Daniel K. Blandford; Guy E. Blelloch; Ian A. Kash (ALENEX/ANALC, 2004)

Dynamizing static algorithms, with applications to dynamic trees and history independence. - Umut A. Acar; Guy E. Blelloch; Robert Harper 001; Jorge L. Vittes; Shan Leung Maverick Woo (SODA, 2004)

Compact representations of ordered sets. - Daniel K. Blandford; Guy E. Blelloch (SODA, 2004)

Effectively sharing a cache among threads. - Guy E. Blelloch; Phillip B. Gibbons (SPAA, 2004)

An Experimental Analysis of Change Propagation in Dynamic Trees. - Umut A. Acar; Guy E. Blelloch; Jorge L. Vittes (ALENEX/ANALCO, 2005)

Dictionaries using variable-length keys and data, with applications. - Daniel K. Blandford; Guy E. Blelloch (SODA, 2005)

Using page residency to balance tradeoffs in tracing garbage collection. - Daniel Spoonhower; Guy E. Blelloch; Robert Harper 001 (VEE, 2005)

A Library for Self-Adjusting Computation. - Umut A. Acar; Guy E. Blelloch; Matthias Blume; Robert Harper 001; Kanat Tangwongsan (ML, 2005)

Compact representations of simplicial meshes in two and three dimensions. - Daniel K. Blandford; Guy E. Blelloch; David E. Cardoze; Clemens Kadow (Int. J. Comput. Geom. Appl., 2005)

Engineering a compact parallel delaunay algorithm in 3D. - Daniel K. Blandford; Guy E. Blelloch; Clemens Kadow (SCG, 2006)

Kinetic Algorithms Via Self-adjusting Computation. - Umut A. Acar; Guy E. Blelloch; Kanat Tangwongsan; Jorge L. Vittes (ESA, 2006)

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. - Guy E. Blelloch; Kedar Dhamdhere; Eran Halperin; R. Ravi 001; Russell Schwartz; Srinath Sridhar 001 (ICALP (1), 2006)

Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. - Srinath Sridhar 001; Kedar Dhamdhere; Guy E. Blelloch; Eran Halperin; R. Ravi 001; Russell Schwartz (International Conference on Computational Science (2), 2006)

An experimental analysis of self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Matthias Blume; Kanat Tangwongsan (PLDI, 2006)

Parallel depth first vs. work stealing schedulers on CMP architectures. - Vasileios Liaskovitis; Shimin Chen; Phillip B. Gibbons; Anastassia Ailamaki; Guy E. Blelloch; Babak Falsafi; Limor Fix; Nikos Hardavellas; Michael Kozuch; Todd C. Mowry; Chris Wilkerson (SPAA, 2006)

Adaptive functional programming. - Umut A. Acar; Guy E. Blelloch; Robert Harper 001 (ACM Trans. Program. Lang. Syst., 2006)

Kinetic 3D convex hulls via self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Kanat Tangwongsan (SCG, 2007)

Strongly History-Independent Hashing with Applications. - Guy E. Blelloch; Daniel Golovin (FOCS, 2007)

Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming. - Srinath Sridhar 001; Fumei Lam; Guy E. Blelloch; R. Ravi 001; Russell Schwartz (ISBRA, 2007)

Scheduling threads for constructive cache sharing on CMPs. - Shimin Chen; Phillip B. Gibbons; Michael Kozuch; Vasileios Liaskovitis; Anastassia Ailamaki; Guy E. Blelloch; Babak Falsafi; Limor Fix; Nikos Hardavellas; Todd C. Mowry; Chris Wilkerson (SPAA, 2007)

Direct maximum parsimony phylogeny reconstruction from genotype data. - Srinath Sridhar 001; Fumei Lam; Guy E. Blelloch; R. Ravi 001; Russell Schwartz (BMC Bioinform., 2007)

Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice. - Srinath Sridhar 001; Kedar Dhamdhere; Guy E. Blelloch; Eran Halperin; R. Ravi 001; Russell Schwartz (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Robust Kinetic Convex Hulls in 3D. - Umut A. Acar; Guy E. Blelloch; Kanat Tangwongsan; Duru Türkoglu (ESA, 2008)

A New Combinatorial Approach for Sparse Graph Problems. - Guy E. Blelloch; Virginia Vassilevska; Ryan Williams 001 (ICALP (1), 2008)

Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. - Guy E. Blelloch (SODA, 2008)

Provably good multicore cache performance for divide-and-conquer algorithms. - Guy E. Blelloch; Rezaul Alam Chowdhury; Phillip B. Gibbons; Vijaya Ramachandran; Shimin Chen; Michael Kozuch (SODA, 2008)

Combinable memory-block transactions. - Guy E. Blelloch; Phillip B. Gibbons; Harsha Vardhan Simhadri (SPAA, 2008)

Uniquely Represented Data Structures for Computational Geometry. - Guy E. Blelloch; Daniel Golovin; Virginia Vassilevska (SWAT, 2008)

Compact dictionaries for variable-length keys and data with applications. - Daniel K. Blandford; Guy E. Blelloch (ACM Trans. Algorithms, 2008)

Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference. - Srinath Sridhar 001; Fumei Lam; Guy E. Blelloch; R. Ravi 001; Russell Schwartz (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Parallel thinking. - Guy E. Blelloch (PPoPP, 2009)

Brief announcement: low depth cache-oblivious sorting. - Guy E. Blelloch; Phillip B. Gibbons; Harsha Vardhan Simhadri (SPAA, 2009)

Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. - Daniel Spoonhower; Guy E. Blelloch; Phillip B. Gibbons; Robert Harper 001 (SPAA, 2009)

An experimental analysis of self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Matthias Blume; Robert Harper 001; Kanat Tangwongsan (ACM Trans. Program. Lang. Syst., 2009)

Succinct Representations of Separable Graphs. - Guy E. Blelloch; Arash Farzan (CPM, 2010)

Functional parallel algorithms. - Guy E. Blelloch (ICFP, 2010)

Traceable data types for self-adjusting computation. - Umut A. Acar; Guy E. Blelloch; Ruy Ley-Wild; Kanat Tangwongsan; Duru Türkoglu (PLDI, 2010)

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. - Guy E. Blelloch; Ioannis Koutis; Gary L. Miller; Kanat Tangwongsan (SC, 2010)

Low depth cache-oblivious algorithms. - Guy E. Blelloch; Phillip B. Gibbons; Harsha Vardhan Simhadri (SPAA, 2010)

Parallel approximation algorithms for facility-location problems. - Guy E. Blelloch; Kanat Tangwongsan (SPAA, 2010)

Space profiling for parallel functional programs. - Daniel Spoonhower; Guy E. Blelloch; Robert Harper 001; Phillip B. Gibbons (J. Funct. Program., 2010)

A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. - Guy E. Blelloch; Julian Shun (ALENEX, 2011)

Scheduling irregular parallel computations on hierarchical caches. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Harsha Vardhan Simhadri (SPAA, 2011)

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs. - Guy E. Blelloch; Anupam Gupta 001; Ioannis Koutis; Gary L. Miller; Richard Peng; Kanat Tangwongsan (SPAA, 2011)

Linear-work greedy parallel approximate set cover and variants. - Guy E. Blelloch; Richard Peng; Kanat Tangwongsan (SPAA, 2011)

Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny. - Navodit Misra; Guy E. Blelloch; R. Ravi 001; Russell Schwartz (J. Comput. Biol., 2011)

An Optimization-Based Sampling Scheme for Phylogenetic Trees. - Navodit Misra; Guy E. Blelloch; R. Ravi 001; Russell Schwartz (J. Comput. Biol., 2011)

A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. - Ming-Chi Tsai; Guy E. Blelloch; R. Ravi 001; Russell Schwartz (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

NESL. - Guy E. Blelloch (Encyclopedia of Parallel Computing, 2011)

Problem Based Benchmarks. - Guy E. Blelloch (ANALCO, 2012)

Non-monotonic Self-Adjusting Computation. - Ruy Ley-Wild; Umut A. Acar; Guy E. Blelloch (ESOP, 2012)

GraphChi: Large-Scale Graph Computation on Just a PC. - Aapo Kyrola; Guy E. Blelloch; Carlos Guestrin (OSDI, 2012)

Internally deterministic parallel algorithms can be fast. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Julian Shun (PPoPP, 2012)

Greedy sequential maximal independent set and matching are parallel on average. - Guy E. Blelloch; Jeremy T. Fineman; Julian Shun (SPAA, 2012)

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. - Guy E. Blelloch; Anupam Gupta 001; Kanat Tangwongsan (SPAA, 2012)

Parallel and I/O efficient set covering algorithms. - Guy E. Blelloch; Harsha Vardhan Simhadri; Kanat Tangwongsan (SPAA, 2012)

Brief announcement: the problem based benchmark suite. - Julian Shun; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Aapo Kyrola; Harsha Vardhan Simhadri; Kanat Tangwongsan (SPAA, 2012)

Introduction to special issue ALENEX'10. - Guy E. Blelloch; Dan Halperin (ACM J. Exp. Algorithmics, 2012)

Efficient BVH Construction via Approximate Agglomerative Clustering. - Yan Gu 001; Yong He 013; Kayvon Fatahalian; Guy E. Blelloch (High Performance Graphics, 2013)

Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). - Giuseppe F. Italiano; Henning Meyerhenke; Guy E. Blelloch; Philippas Tsigas (Euro-Par, 2013)

Program-centric cost models for locality. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Harsha Vardhan Simhadri (MSPC@PLDI, 2013)

Cache and I/O efficent functional algorithms. - Guy E. Blelloch; Robert Harper 001 (POPL, 2013)

Ligra: a lightweight graph processing framework for shared memory. - Julian Shun; Guy E. Blelloch (PPoPP, 2013)

Reducing contention through priority updates. - Julian Shun; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons (SPAA, 2013)

Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data. - Ming-Chi Tsai; Guy E. Blelloch; R. Ravi 001; Russell Schwartz (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Phase-concurrent hash tables for determinism. - Julian Shun; Guy E. Blelloch (SPAA, 2014)

A simple and practical linear-work parallel algorithm for connectivity. - Julian Shun; Laxman Dhulipala; Guy E. Blelloch (SPAA, 2014)

Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest. - Aapo Kyrola; Julian Shun; Guy E. Blelloch (SEA, 2014)

Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. - Guy E. Blelloch; Anupam Gupta 001; Ioannis Koutis; Gary L. Miller; Richard Peng; Kanat Tangwongsan (Theory Comput. Syst., 2014)

A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction. - Julian Shun; Guy E. Blelloch (ACM Trans. Parallel Comput., 2014)

Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+. - Julian Shun; Laxman Dhulipala; Guy E. Blelloch (DCC, 2015)

Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. - Niklas Baumstark; Guy E. Blelloch; Julian Shun (ESA, 2015)

Coupling Memory and Computation for Locality Management. - Umut A. Acar; Guy E. Blelloch; Matthew Fluet; Stefan K. Muller; Ram Raghunathan (SNAPL, 2015)

Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. - Julian Shun; Yan Gu 001; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons (SODA, 2015)

Sorting with Asymmetric Read and Write Costs. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Julian Shun (SPAA, 2015)

A Top-Down Parallel Semisort. - Yan Gu 001; Julian Shun; Yihan Sun 001; Guy E. Blelloch (SPAA, 2015)

Cache efficient functional algorithms. - Guy E. Blelloch; Robert Harper 001 (Commun. ACM, 2015)

Ray Specialized Contraction on Bounding Volume Hierarchies. - Yan Gu 001; Yong He 013; Guy E. Blelloch (Comput. Graph. Forum, 2015)

Efficient Algorithms under Asymmetric Read and Write Costs. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Julian Shun (CoRR, 2015)

Efficient Algorithms with Asymmetric Read and Write Costs. - Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Julian Shun (ESA, 2016)

Hierarchical memory management for parallel programs. - Ram Raghunathan; Stefan K. Muller; Umut A. Acar; Guy E. Blelloch (ICFP, 2016)

Parallel Algorithms for Asymmetric Read-Write Costs. - Naama Ben-David; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (SPAA, 2016)

Parallel Shortest Paths Using Radius Stepping. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001; Kanat Tangwongsan (SPAA, 2016)

Just Join for Parallel Ordered Sets. - Guy E. Blelloch; Daniel Ferizovic; Yihan Sun 001 (SPAA, 2016)

A New Efficient Construction on Probabilistic Tree Embeddings. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (CoRR, 2016)

Parallel Ordered Sets Using Join. - Guy E. Blelloch; Daniel Ferizovic; Yihan Sun 001 (CoRR, 2016)

Experimental Analysis of Space-Bounded Schedulers. - Harsha Vardhan Simhadri; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Aapo Kyrola (ACM Trans. Parallel Comput., 2016)

Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies. - Guy E. Blelloch; Phillip B. Gibbons; Harsha Vardhan Simhadri (HiPC, 2017)

Efficient Construction of Probabilistic Tree Embeddings. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (ICALP, 2017)

Analyzing Contention and Backoff in Asynchronous Shared Memory. - Naama Ben-David; Guy E. Blelloch (PODC, 2017)

Some Sequential Algorithms are Almost Always Parallel. - Guy E. Blelloch (PODC, 2017)

Parallel functional arrays. - Ananya Kumar; Guy E. Blelloch; Robert Harper 001 (POPL, 2017)

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. - Laxman Dhulipala; Guy E. Blelloch; Julian Shun (SPAA, 2017)

Technical Perspective: Functional compilers. - Guy E. Blelloch (Commun. ACM, 2017)

Parallel lightweight wavelet tree, suffix array and FM-index construction. - Julian Labeit; Julian Shun; Guy E. Blelloch (J. Discrete Algorithms, 2017)

Optimally Scheduling Jobs with Multiple Tasks. - Ziv Scully; Guy E. Blelloch; Mor Harchol-Balter; Alan Scheller-Wolf (SIGMETRICS Perform. Evaluation Rev., 2017)

Algorithmic Building Blocks for Asymmetric Memories. - Yan Gu 001; Yihan Sun 001; Guy E. Blelloch (ESA, 2018)

Implicit Decomposition for Write-Efficient Connectivity Algorithms. - Naama Ben-David; Guy E. Blelloch; Jeremy T. Fineman; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (IPDPS, 2018)

PAM: parallel augmented maps. - Yihan Sun 001; Daniel Ferizovic; Guy E. Blelloch (PPoPP, 2018)

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. - Guy E. Blelloch; Yan Gu 001; Julian Shun; Yihan Sun 001 (SPAA, 2018)

The Parallel Persistent Memory Model. - Guy E. Blelloch; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (SPAA, 2018)

Efficient Single Writer Concurrency. - Naama Ben-David; Guy E. Blelloch; Yihan Sun 001; Yuanhao Wei (CoRR, 2018)

Parallel Range and Segment Queries with Augmented Maps. - Yihan Sun 001; Guy E. Blelloch (CoRR, 2018)

Making Concurrent Algorithms Detectable. - Naama Ben-David; Guy E. Blelloch; Yuanhao Wei (CoRR, 2018)

Unfair Scheduling Patterns in NUMA Architectures. - Naama Ben-David; Ziv Scully; Guy E. Blelloch (PACT, 2019)

Parallel Range, Segment and Rectangle Queries with Augmented Maps. - Yihan Sun 001; Guy E. Blelloch (ALENEX, 2019)

Batch-Parallel Euler Tour Trees. - Thomas Tseng; Laxman Dhulipala; Guy E. Blelloch (ALENEX, 2019)

Low-latency graph streaming using compressed purely-functional trees. - Laxman Dhulipala; Guy E. Blelloch; Julian Shun (PLDI, 2019)

Implementing parallel and concurrent tree structures. - Yihan Sun 001; Guy E. Blelloch (PPoPP, 2019)

Making concurrent algorithms detectable: poster. - Naama Ben-David; Guy E. Blelloch; Michal Friedman 001; Yuanhao Wei (PPoPP, 2019)

Parallel Batch-Dynamic Graph Connectivity. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala (SPAA, 2019)

Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. - Naama Ben-David; Guy E. Blelloch; Yihan Sun 001; Yuanhao Wei (SPAA, 2019)

Delay-Free Concurrency on Faulty Persistent Memory. - Naama Ben-David; Guy E. Blelloch; Michal Friedman 001; Yuanhao Wei (SPAA, 2019)

Semi-Asymmetric Parallel Graph Algorithms for NVRAMs. - Laxman Dhulipala; Charles McGuffey; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Phillip B. Gibbons; Julian Shun (CoRR, 2019)

On Supporting Efficient Snapshot Isolation for Hybrid Workloads with Multi-Versioned Indexes. - Yihan Sun 001; Guy E. Blelloch; Wan Shen Lim; Andrew Pavlo (Proc. VLDB Endow., 2019)

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. - Guy E. Blelloch; Yan Gu 001 (APOCS, 2020)

Parallel Batch-Dynamic Trees via Change Propagation. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Sam Westrick (ESA, 2020)

NVTraverse: in NVRAM data structures, the destination is more important than the journey. - Michal Friedman 001; Naama Ben-David; Yuanhao Wei; Guy E. Blelloch; Erez Petrank (PLDI, 2020)

The Graph Based Benchmark Suite (GBBS). - Laxman Dhulipala; Jessica Shi 001; Tom Tseng; Guy E. Blelloch; Julian Shun (GRADES-NDA@SIGMOD, 2020)

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. - Daniel Anderson; Guy E. Blelloch; Kanat Tangwongsan (SPAA, 2020)

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. - Guy E. Blelloch; Daniel Anderson; Laxman Dhulipala (SPAA, 2020)

Optimal Parallel Algorithms in the Binary-Forking Model. - Guy E. Blelloch; Jeremy T. Fineman; Yan Gu 001; Yihan Sun 001 (SPAA, 2020)

Randomized Incremental Convex Hull is Highly Parallel. - Guy E. Blelloch; Yan Gu 001; Julian Shun; Yihan Sun 001 (SPAA, 2020)

LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. - Guy E. Blelloch; Yuanhao Wei (DISC, 2020)

Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. - Guy E. Blelloch; Yuanhao Wei (DISC, 2020)

Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. - Umut A. Acar; Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Sam Westrick (CoRR, 2020)

Concurrent Reference Counting and Resource Management in Wait-free Constant Time. - Guy E. Blelloch; Yuanhao Wei (CoRR, 2020)

Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. - Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001; Yuanhao Wei (CoRR, 2020)

Concurrent Fixed-Size Allocation and Free in Constant Time. - Guy E. Blelloch; Yuanhao Wei (CoRR, 2020)

Parallelism in Randomized Incremental Algorithms. - Guy E. Blelloch; Yan Gu 001; Julian Shun; Yihan Sun 001 (J. ACM, 2020)

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. - Laxman Dhulipala; Charles McGuffey; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Phillip B. Gibbons; Julian Shun (Proc. VLDB Endow., 2020)

The Read-Only Semi-External Model. - Guy E. Blelloch; Laxman Dhulipala; Phillip B. Gibbons; Yan Gu 001; Charles McGuffey; Julian Shun (APOCS, 2021)

Is Asymptotic Cost Analysis Useful in Developing Practical Parallel Algorithms. - Guy E. Blelloch (IPDPS, 2021)

Concurrent deferred reference counting with constant-time overhead. - Daniel Anderson; Guy E. Blelloch; Yuanhao Wei (PLDI, 2021)

Constant-time snapshots with applications to concurrent data structures. - Yuanhao Wei; Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001 (PPoPP, 2021)

Efficient Parallel Self-Adjusting Computation. - Daniel Anderson; Guy E. Blelloch; Anubhav Baweja; Umut A. Acar (SPAA, 2021)

SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. - Guy E. Blelloch; William J. Dally; Margaret Martonosi; Uzi Vishkin; Katherine A. Yelick (SPAA, 2021)

The Processing-in-Memory Model. - Hongbo Kang; Phillip B. Gibbons; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey (SPAA, 2021)

Space and Time Bounded Multiversion Garbage Collection. - Naama Ben-David; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert; Yihan Sun 001; Yuanhao Wei (DISC, 2021)

Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth. - Daniel Anderson; Guy E. Blelloch (CoRR, 2021)

Fast and Fair Lock-Free Locks. - Naama Ben-David; Guy E. Blelloch (CoRR, 2021)

The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model. - Guy E. Blelloch; Magdalen Dobson (CoRR, 2021)

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. - Laxman Dhulipala; Guy E. Blelloch; Julian Shun (ACM Trans. Parallel Comput., 2021)

Parallel Nearest Neighbors in Low Dimensions with Batch Updates. - Guy E. Blelloch; Magdalen Dobson (ALENEX, 2022)

Turning manual concurrent memory reclamation into automatic reference counting. - Daniel Anderson; Guy E. Blelloch; Yuanhao Wei (PLDI, 2022)

PaC-trees: supporting parallel and compressed purely-functional collections. - Laxman Dhulipala; Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (PLDI, 2022)

The problem-based benchmark suite (PBBS), V2. - Daniel Anderson; Guy E. Blelloch; Laxman Dhulipala; Magdalen Dobson; Yihan Sun 001 (PPoPP, 2022)

Lock-free locks revisited. - Naama Ben-David; Guy E. Blelloch; Yuanhao Wei (PPoPP, 2022)

FliT: a library for simple and efficient persistent algorithms. - Yuanhao Wei; Naama Ben-David; Michal Friedman 001; Guy E. Blelloch; Erez Petrank (PPoPP, 2022)

Parallel block-delayed sequences. - Sam Westrick; Mike Rainey; Daniel Anderson; Guy E. Blelloch (PPoPP, 2022)

PIM-tree: A Skew-resistant Index for Processing-in-Memory. - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (Proc. VLDB Endow., 2022)

Joinable Parallel Balanced Binary Trees. - Guy E. Blelloch; Daniel Ferizovic; Yihan Sun 001 (ACM Trans. Parallel Comput., 2022)

Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact). - Yuanhao Wei; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert (Zenodo, 2022)

Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract). - Daniel Anderson; Guy E. Blelloch; Yuanhao Wei (HOPC@SPAA, 2023)

PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract). - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (HOPC@SPAA, 2023)

The Geometry of Tree-Based Sorting. - Guy E. Blelloch; Magdalen Dobson (ICALP, 2023)

Practically and Theoretically Efficient Garbage Collection for Multiversioning. - Yuanhao Wei; Guy E. Blelloch; Panagiota Fatourou; Eric Ruppert (PPoPP, 2023)

Are Parallel Algorithms Ready for Prime Time? - Guy E. Blelloch (SPAA, 2023)

PIM-trie: A Skew-resistant Trie for Processing-in-Memory. - Hongbo Kang; Yiwei Zhao; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Charles McGuffey; Phillip B. Gibbons (SPAA, 2023)

Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis. - Magdalen Dobson; Zheqi Shen; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Harsha Vardhan Simhadri; Yihan Sun 001 (CoRR, 2023)

Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span. - Daniel Anderson; Guy E. Blelloch (CoRR, 2023)

VERLIB: Concurrent Versioned Pointers. - Guy E. Blelloch; Yuanhao Wei (Zenodo, 2023)

VERLIB: Concurrent Versioned Pointers. - Guy E. Blelloch; Yuanhao Wei (Zenodo, 2023)

Parallel Minimum Cuts in O(m log2 n) Work and Low Depth. - Daniel Anderson; Guy E. Blelloch (ACM Trans. Parallel Comput., 2023)

Lock-Free Locks Revisited (Abstract). - Naama Ben-David; Guy E. Blelloch; Yuanhao Wei (HOPC@SPAA, 2024)

Teaching Parallel Algorithms Using the Binary-Forking Model. - Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (IPDPS (Workshops), 2024)

VERLIB: Concurrent Versioned Pointers. - Guy E. Blelloch; Yuanhao Wei (PPoPP, 2024)

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. - Magdalen Dobson Manohar; Zheqi Shen; Guy E. Blelloch; Laxman Dhulipala; Yan Gu 001; Harsha Vardhan Simhadri; Yihan Sun 001 (PPoPP, 2024)

Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees. - Daniel Anderson; Guy E. Blelloch (SPAA, 2024)

Parallel Cluster-BFS and Applications to Shortest Paths. - Letong Wang; Guy E. Blelloch; Yan Gu 001; Yihan Sun 001 (HOPC@SPAA, 2025)

Big Atomics and Fast Hash Tables. - Daniel Anderson; Guy E. Blelloch; Siddhartha V. Jayanti (PPoPP, 2025)

Parallel Batch-Dynamic Maximal Matching with Constant Work per Update. - Guy E. Blelloch; Andrew C. Brady (SPAA, 2025)

TLF: Transactional Lock Fusion. - Guy E. Blelloch; Zachary Kent; Yuanhao Wei (SPAA, 2025)

Parallel Batch Queries on Dynamic Trees: Algorithms and Experiments. - Humza Ikram; Andrew C. Brady; Daniel Anderson; Guy E. Blelloch (SPAA, 2025)

CLEANN: Lock-Free Augmented Trees for Low-Dimensional κ-Nearest Neighbor Search. - Magdalen Dobson Manohar; Yuanhao Wei; Guy E. Blelloch (SPAA, 2025)

Optimal Batch-Dynamic kd-trees for Processing-in-Memory with Applications. - Yiwei Zhao; Hongbo Kang; Yan Gu 001; Guy E. Blelloch; Laxman Dhulipala; Charles McGuffey; Phillip B. Gibbons (SPAA, 2025)

Big Atomics. - Daniel Anderson; Guy E. Blelloch; Siddhartha Jayanti (CoRR, 2025)

Range Retrieval with Graph-Based Indices. - Magdalen Dobson Manohar; Taekseung Kim; Guy E. Blelloch (CoRR, 2025)

Fast and fair randomized wait-free locks. - Naama Ben-David; Guy E. Blelloch (Distributed Comput., 2025)