Publications
A probably more complete list of papers, along with full bibliographical information can be found at the University of Trier Computer Science Bibliography database.
2023
Guy E. Blelloch and Magdalen Dobson.
The Geometry of Tree-Based Sorting.
ICALP 2023.
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou and Eric Ruppert.
Practically and Theoretically Efficient Garbage Collection for Multiversioning.
PPoPP 2023.
Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey and Phillip B. Gibbons.
PIM-trie: A Skew-resistant Trie for Processing-in-Memory.
SPAA 2023.
2022
Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, and Phillip B. Gibbons.
PIM-tree: A Skew-resistant Index for Processing-in-Memory.
VLDB 2022.
Guy E. Blelloch, Daniel Ferizovic, and Yihan Sun.
Joinable Parallel Balanced Binary Trees.
ACM Trans. Parallel Comput. (2022)
Guy E. Blelloch and Magdalen Dobson.
Parallel Nearest Neighbors in Low Dimensions with Batch Updates.
ALENEX 2022.
Daniel Anderson, Guy E. Blelloch and Yuanhao Wei.
Turning manual concurrent memory reclamation into automatic reference counting.
PLDI 2022.
Laxman Dhulipala, Guy E. Blelloch, Yan Gu and Yihan Sun.
PaC-trees: supporting parallel and compressed purely-functional collections.
PLDI 2022.
Naama Ben-David and Guy E. Blelloch.
Fast and Fair Randomized Wait-Free Locks.
PODC 2022.
Sam Westrick, Mike Rainey, Daniel Anderson and Guy E. Blelloch.
Parallel block-delayed sequences.
PPoPP 2022.
Naama Ben-David, Guy E. Blelloch and Yuanhao Wei.
Lock-free locks revisited.
PPoPP 2022.
Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch and Erez Petrank.
FliT: a library for simple and efficient persistent algorithms.
PPoPP 2022.
2021
Laxman Dhulipala, Guy E. Blelloch, Julian Shun.
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.
ACM Trans. Parallel Comput (2021)
Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun.
The Read-Only Semi-External Model.
APOCS 2021
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei.
Concurrent deferred reference counting with constant-time overhead.
PLDI 2021
Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun.
Constant-time snapshots with applications to concurrent data structures.
PPoPP 2021
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar.
Efficient Parallel Self-Adjusting Computation.
SPAA 2021
Daniel Anderson, Guy E. Blelloch.
Parallel Minimum Cuts in O(m log2n) Work and Low Depth.
SPAA 2021
Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dulipala, Yan Gu, Charles McGuffey.
The Processing-in-Memory Model.
SPAA 2021
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yua.hao Wei:
Space and Time Bounded Multiversion Garbage Collection.
DISC 2021
2020
Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun.
Parallelism in Randomized Incremental Algorithms.
J. ACM (2020)
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun.
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs.
VLDB 2020
Guy E. Blelloch, Yan Gu.
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract].
APOCS 2020: 105-119
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick.
Parallel Batch-Dynamic Trees via Change Propagation.
ESA 2020.
Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank.
NVTraverse: in NVRAM data structures, the destination is more important than the journey.
PLDI 2020.
Laxman Dhulipala, Jessica Shi, Tom Tseng, Guy E. Blelloch, Julian Shun.
The Graph Based Benchmark Suite (GBBS).
GRADES-NDA@SIGMOD 2020.
Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan.
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.
SPAA 2020
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun.
Optimal Parallel Algorithms in the Binary-Forking Model.
SPAA 2020
Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun.
Randomized Incremental Convex Hull is Highly Parallel.
SPAA 2020
Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala.
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines.
SPAA 2020
Guy E. Blelloch, Yuanhao Wei.
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS.
DISC 2020
Guy E. Blelloch, Yuanhao Wei.
Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time.
DISC 2020
2017-2019
See DBLP.2016
Guy Blelloch, Yan Gu, Julian Shun and Yihan Sun.
Parallelism in Randomized Incremental Algorithms.
SPAA 2016.
Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey and Julian Shun.
Parallel Algorithms for Asymmetric Read-Write Costs.
SPAA 2016.
Guy Blelloch, Yan Gu, Yihan Sun and Kanat Tangwongsan.
Parallel Shortest Paths Using Radius Stepping.
SPAA 2016.
Guy Blelloch, Daniel Ferizovic, and Yihan Sun.
Just Join for Parallel Ordered Sets.
SPAA 2016.
Julian Labeit, Julian Shun and Guy Blelloch.
Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction.
IEEE DCC 2016.
2015
Guy Blelloch and Robert Harper.
Cache Efficient Functional Algorithms.
CACM 2015.
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun.
Sorting with Asymmetric Read and Write Costs.
SPAA 2015.
Yan Gu, Julian Shun, Yihan Sun and Guy Blelloch.
A Top-Down Parallel Semisort.
SPAA 2015.
Umut A. Acar, Guy E. Blelloch, Matthew Fluet, Stefan K. Muller, Ram Raghunathan.
Coupling Memory and Computation for Locality Management.
SNAPL 2016.
Niklas Baumstark, Guy E. Blelloch, Julian Shun
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm
ask others.
ESA 2015.
Yan Gu, Yong He and Guy E. Blelloch.
Ray Specialized Contraction on Bounding Volume Hierarchies.
Computer Graphics Forum 2105.
Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman
and Phillip B. Gibbons.
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel.
SODA 2015.
2014
Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, and Kanat Tangwongsan.
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.
Theory of Computing Systems (TCS), 2014.
Julian Shun and Guy E. Blelloch.
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction.
TOPC 2014.
Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons and Aapo Kyrola.
Experimental analysis of space-bounded schedulers.
SPAA 2014.
Julian Shun and Guy E. Blelloch.
Phase-concurrent hash tables for determinism.
SPAA 2014.
Julian Shun, Laxman Dhulipala and Guy E. Blelloch.
A simple and practical linear-work parallel algorithm for connectivity.
SPAA 2014.
Aapo Kyrola, Julian Shun and Guy E. Blelloch.
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest.
SEA 2014.
2013
Yan Gu, Yong He, Kayvon Fatahalian, Guy E. Blelloch.
Efficient BVH Construction via Approximate Agglomerative Clustering.
High Performance Graphics, 2013.
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons and Harsha Vardhan Simhadri.
Program-centric cost models for locality.
MSPC@PLDI, 2013.
Guy E. Blelloch and Robert Harper
Cache and I/O efficent functional algorithms.
POPL 2013.
Julian Shun and Guy E. Blelloch.
Ligra: a lightweight graph processing framework for shared memory.
PPOPP 2013.
p
Julian Shun, Guy E. Blelloch, Jeremy T. Fineman and Phillip B. Gibbons.
Reducing contention through priority updates.
SPAA 2013.
2012
Ming-Chi Tsai, Guy E. Blelloch, Russell Schwartz and R. Ravi.
Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data.
BCB 2012.
Ruy Ley-Wild, Umut A. Acar and Guy E. Blelloch.
Non-monotonic Self-Adjusting Computation.
ESOP 2012.
Aapo Kyrola, Guy E. Blelloch and Carlos Guestrin.
GraphChi: Large-Scale Graph Computation on Just a PC.
OSDI 2012.
Guy E. Blelloch, Harsha Vardhan Simhadri and Kanat Tangwongsan.
Parallel and I/O efficient set covering algorithms.
SPAA 2012.
Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan:
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design.
SPAA 2012.
Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy sequential maximal independent set and matching are parallel on average.
SPAA 2012.
Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, and Julian Shun.
Internally Deterministic Parallel Algorithms Can Be Fast.
Proc. ACM Symposium on Principles and Practice of Parallel Programming (PPoPP), February 2012.
Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Brief announcement: the problem based benchmark suite.
SPAA 2012.
2011
Daniel Spoonhower, Guy E. Blelloch, Robert Harper, and Phillip
B. Gibbons.
Space profiling for parallel functional programs.
Journal of Functional Programming. 20 (5-6), 2011.
Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphsSPAA '11 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, 2011
Scheduling irregular parallel computations on hierarchical cachesSPAA '11 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, 2011
Linear-work greedy parallel approximate set cover and variantsSPAA '11 Proceedings of the 23rd ACM symposium on Parallelism in algorithms and architectures, 2011
Navodit Misra, Guy E. Blelloch, R. Ravi, and Russell Schwartz.
An Optimization-Based Sampling Scheme for Phylogenetic Trees.
Proc. Conference on Research in Computational Molecular
Biology (RECOMB), March 2011.
Guy Blelloch and Julian Shun.
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction.
Proc. SIAM Workshop on Algorithm Engineering and Experiments
(ALENEX), January 2011.
2010
Guy E. Blelloch and Bruce M. Maggs
Parallel Algorithms
Chapter 25 in the "Algorithms and Theory of Computation Handbook".
Editors: Mikhail Atallah and Marina Blanton.
Chapman & Hall/CRC, 2010.
Guy E. Blelloch, Ioannis Koutis, Gary L. Miller and Kanat Tangwongsan.
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid.
Proc. ACM/IEEE Conf. on High Performance Computing Networking, Storage and Analysis (SC),
November 2010.
Functional parallel algorithms (invited talk) : movie and slidesICFP '10 Proceedings of the 15th ACM SIGPLAN international conference on Functional programming, 2010
Low depth cache-oblivious algorithmsSPAA '10 Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures, 2010
Parallel approximation algorithms for facility-location problemsSPAA '10 Proceedings of the 22nd ACM symposium on Parallelism in algorithms and architectures, 2010
Traceable data types for self-adjusting computationPLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation, 2010
Guy E. Blelloch and Arash Farzan.
Succinct Representations of Separable Graphs.
Symposium on Combinatorial Pattern Matching (CPM), June 2010.
Ming-Chi Tsai, Guy E. Blelloch, R. Ravi and Russell Schwartz.
A Consensus Tree Approach for Reconstructing Human Evolutionary
History and Detecting Population Substructure.
Proc. International Symposium
on Bioinformatics Research and Applications. (ISBRA), May 2010.
Navodit Misra, Guy Blelloch, R Ravi and Russell Schwartz.
Generalized Buneman pruning for inferring the most parsimonious multi-state phylogeny.
Conference on Research in Computational Molecular Biology (RECOMB), April 2010.
2009
An experimental analysis of self-adjusting computationACM Transactions on Programming Languages and Systems (TOPLAS), 2009
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futuresSPAA '09 Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, 2009
Brief announcement: low depth cache-oblivious sortingSPAA '09 Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures, 2009
Parallel thinking (keynote talk) : abstract
and slidesPPoPP '09 Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming, 2009
2008
Space profiling for parallel functional programsACM SIGPLAN Notices - ICFP '08, 2008
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, and Duru Trkoglu
Robust Kinetic Convex Hulls in 3D.
European Symposium on Algorithms (ESA), September 2008.
Guy E. Blelloch, Virginia Vassilevska, and Ryan Williams
A New Combinatorial Approach for Sparse Graph Problems.
International Colloquium on Automata, Languages and Programming (ICALP), July 2008.
Guy E. Blelloch, Daniel Golovin, and Virginia Vassilevska
Uniquely Represented Data Structures for Computational Geometry.
Proc. Scandinavian Workshop on Algorithm Theory (SWAT), July 2008.
Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, and Russell Schwartz
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny
Inference.
ACM/IEEE Transactions on Computational Biology and Bioinformatics (TCBB), July 2008.
Combinable memory-block transactionsSPAA '08 Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures, 2008
Guy E. Blelloch
Space-Efficient Dynamic Orthogonal Point Location, Segment
Intersection, and Range Reporting.
SIAM/ACM Symposium on Discrite Algortithms (SODA), January 2008.
Rezaul A. Chowdhury, Vijaya Ramachandran, Guy E. Blelloch, Phillip B. Gibbons, Shimin Chen and Michael Kozuch.
Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms.
SIAM/ACM Symposium on Discrite Algortithms (SODA), January 2008.
2007
Scheduling threads for constructive cache sharing on CMPsSPAA '07 Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, 2007
Kinetic 3D convex hulls via self-adjusting computationSCG '07 Proceedings of the twenty-third annual symposium on Computational geometry, 2007
Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch,
Eran Halperin, R. Ravi and Russell Schwartz
Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.
ACM/IEEE Transactions on Computational Biology and Bioinformatics (TCBB), October 2007.
Guy E. Blelloch and Daniel Golovin.
Strongly History-Independent Hashing with Applications
IEEE Symposium on Foundations of Computer Science (FOCS), October 2007.
Shimin Chen, Phillip B. Gibbons, Michael Kozuch, Vasileios
Liaskovitis, Anastassia Ailamaki, Guy E. Blelloch, Babak Falsafi,
Limor Fix, Nikos Hardavellas, Todd C. Mowry, and Chris Wilkerson.
Scheduling threads for constructive cache sharing on CMPs.
Proc. ACM Symposium on Parallel Algorithms and Architectures (SPAA),
June 2007.
Umut A. Acar, Guy E. Blelloch, and Kanat Tangwongsan.
Kinetic 3D convex hulls via self-adjusting computation.
(Video presentation,
Short description)
Proc. ACM Symposium on Computational Geometry (SoCG), June 2007.
Srinath Sridhar, Fumei Lam, Guy Blelloch, R. Ravi and Russell
Schwartz.
Efficiently Finding the Most Parsimonious Phylogenetic
Tree via Linear Programming.
Proc. International Symposium on Bioinformatics Research and
Applications. (ISBRA), Best Paper Award, May 2007.
2006
Adaptive functional programmingACM Transactions on Programming Languages and Systems (TOPLAS), 2006
Parallel depth first vs. work stealing schedulers on CMP architecturesSPAA '06 Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures, 2006
An experimental analysis of self-adjusting computationACM SIGPLAN Notices - Proceedings of the 2006 PLDI Conference, 2006
Engineering a compact parallel delaunay algorithm in 3DSCG '06 Proceedings of the twenty-second annual symposium on Computational geometry, 2006
Umut Acar, Guy Blelloch, and Robert Harper.
Adaptive Functional Programming.
ACM Transactions on Programming Languages and Systems (TOPLAS), November 2006.
Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, and Jorge L. Vittes.
Kinetic Algorithms via Self-Adjusting Computation.
European Symposium on Algorithms (ESA), September 2006.
Srinath Sridhar, Guy E. Blelloch, R. Ravi, and Russell Schwartz.
Optimal Imperfect Phylogeny Reconstruction and Haplotyping (IPPH).
Computational Systems Bioinformatics (CSB) Conference, August 2006.
Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, and Srinath Sridhar.
Fixed Parameter tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.
International Colloquium on Automata, Languages and Programming (ICALP), July 2006.
See journal version
Daniel K. Blandford, Guy E. Blelloch, and Clemens Kadow.
Engineering a Compact Parallel Delaunay Algorithm in 3D.
ACM Symposium on Computational Geometry (SoCG), June 2006.
Umut A. Acar, Guy E. Blelloch, Matthias Blume, and Kanat Tangwongsan.
An Experimental Analysis of Self-Adjusting Computation.
ACM SIGPLAN Conference on Programming Language Design and
Implementation (PLDI), June 2006.
Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, and Russell Schwartz.
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.
International Workshop on Bioinformatics Research and Applications (IWBRA), May 2006.
See journal version
2005
Using page residency to balance tradeoffs in tracing garbage collectionVEE '05 Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments, 2005
Umut Acar, Guy Blelloch, Matthias Blume, Robert Harper, and Kanat Tangwongsan.
A Library for Self-Adjusting Computation.
ACM SIGPLAN Workshop on ML, September 2005.
Daniel Spoonhower, Guy Blelloch, and Robert Harper.
Objects and their collection: Using page residency to balance tradeoffs in tracing garbage collection
ACM/USENIX international conference on Virtual execution environments,
June 2005.
Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, and Clemens Kadow.
Compact representations of simplicial meshes in two and three dimensions.
International Journal of Computational Geometry and Applications, February 2005.
Daniel K. Blandford and Guy E. Blelloch.
Dictionaries using variable-length keys and data, with applications.
SIAM/ACM Symposium on Discrite Algortithms (SODA), January 2005.
See journal version
Umut A. Acar, Guy E. Blelloch, and Jorge L. Vittes.
An Experimental Analysis of Change Propagation in Dynamic Trees
Workshop on Algorithms Engineering and Experiments (ALENEX), January 2005.
2004
Effectively sharing a cache among threadsSPAA '04 Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, 2004
Guy E. Blelloch, and
Phillip B. Gibbons
Effectively Sharing a Cache Among Threads
ACM Symposium on Parallelism in Algorithms and Architecture (SPAA), June 2004.
Umut A. Acar,
Guy E. Blelloch,
Robert Harper,
Jorge L. Vittes, and
Shan Leung Maverick Woo
Dynamizing Static Algorithms, with Applications to Dynamic
Trees and History Independence
ACM/SIAM Symposium on Discrete Algorithms (SODA), January 2004.
Daniel K. Blandford and Guy E. Blelloch.
Compact Representations of Ordered Sets
ACM/SIAM Symposium on Discrete Algorithms (SODA), January 2004.
Daniel Blandford, Guy E. Blelloch, and Ian Kash.
An Experimental Analysis of a Compact Graph Representation
Workshop on Algorithms Engineering and Experiments (ALENEX), January 2004.
2003
Selective memoizationPOPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2003
Aleksandar Nanevski, Guy Blelloch, Robert Harper.
Automatic Generation of Staged Geometric Predicates
Higher-Order and Symbolic Computation, 16(4), December 2003.
Guy E. Blelloch, Perry Cheng, and Phillip B. Gibbons.
Scalable Room Synchronizations
Theory of Computing Systems (TCS), 36(5), September 2003.
Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, and Clemens Kadow.
Compact Representations of Simplicial Meshes in Two and Three
Dimensions
International Meshing Roundtable (IMR), September 2003.
Umut A. Acar, Guy E. Blelloch and, Robert Harper.
Selective Memoization
ACM Symposium on Principles of Programming Languages (POPL), January 2003.
Daniel Blandford, Guy E. Blelloch, and Ian Kash.
Compact Representations of Separable Graphs.
ACM/SIAM Symposium on Discrete Algorithms (SODA), January 2003.
Guy E. Blelloch, Bruce Maggs, and Maverick Woo.
Space-Efficient Finger Search on Degree-Balanced Search Trees.
ACM/SIAM Symposium on Discrete Algorithms (SODA), January 2003.
2002
Adaptive functional programmingPOPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2002
Umut Acar, Guy Blelloch, and Robert Blumofe.
The Data Locality of Work Stealing.
Theory of Computing Systems (TCS), 35(3), May 2002.
Daniel Blandford and Guy E. Blelloch.
Index Compression through Document Reordering.
IEEE Data Compression Conference (DCC), April 2002.
Umut Acar, Guy Blelloch, and Robert Harper.
Adaptive Functional Programming.
ACM Symposium on Principles of Programming Languages (POPL), January 2002.
See journal version
2001
Automatic generation of staged geometric predicatesICFP '01 Proceedings of the sixth ACM SIGPLAN international conference on Functional programming, 2001
Room synchronizationsSPAA '01 Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, 2001
A parallel, real-time garbage collectorPLDI '01 Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation, 2001
Guy Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary Miller, Noel Walkington.
Persistent Triangulations.
Journal of Functional Programming (JFP), 11(5), September 2001.
Aleksandar Nanevski, Guy Blelloch, and Robert Harper.
Automatic Generation of Staged Geometric Predicates.
ACM International Conference on Functional Programming (ICFP), September 2001.
Perry Cheng and Guy E. Blelloch.
A Parallel, Real-Time Garbage Collector.
ACM SIGPLAN Symposium on Programming Language Design and Implementation (PLDI), June 2001.
Guy E. Blelloch, Perry Cheng and Phillip B. Gibbons.
Room synchronizations
ACM Symposium on Parallel Algorithms and Architectures (SPAA),
July 2001.
2000
The data locality of work stealingSPAA '00 Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures, 2000
James F. Antaki, Guy E. Blelloch, Omar Ghattas, Ivan Malcevic, Gary L. Miller, and Noel Walkington.
A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces.
Supercomputing 2000, November 2000.
1999
On bounding time and space for multiprocessor garbage collectionPLDI '99 Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, 1999
Space-efficient scheduling of nested parallelismACM Transactions on Programming Languages and Systems (TOPLAS), 1999
Guy E. Blelloch and Perry Cheng.
On Bounding Time and Space for Multiprocessor Garbage Collection.
ACM SIGPLAN Symposium on Programming Language Design and Implementation (PLDI),
May 1999.
G. E. Blelloch, P. Gibbons and Y. Matias.
Provably
Efficient Scheduling for Languages with Fine-Grained
Parallelism.
Journal of the ACM (JACM), 46(2), March 1999.
Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, and Dafna Talmor.
Design and Implementation of a Practical Parallel Delaunay Algorithm.
Algorithmica, 24(3/4), 1999.
Girija J. Narlikar and Guy E. Blelloch.
Space-Efficient Implementation of Nested Parallelism
ACM Transactions on Programming Languages and Systems (TOPLAS),
21(1), January 1999.
John Greiner and Guy E. Blelloch.
A Provably Time-Efficient Parallel Implementation of Full Speculation
ACM Transactions on Programming Languages and Systems (TOPLAS),
21(2), March 1999.
Guy E. Blelloch and Margaret Reid-Miller.
Pipelining with Futures
Theory of Computing Systems (TCS), 32(3), 1999.
1998
Fast set operations using treapsSPAA '98 Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, 1998
Guy E. Blelloch and Margaret Reid-Miller.
Fast Set Operations Using Treaps.
ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 1998.
1997 and before
Space-efficient implementation of nested parallelismPPOPP '97 Proceedings of the sixth ACM SIGPLAN symposium on Principles and practice of parallel programming, 1997
Pipelining with futuresSPAA '97 Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, 1997
Space-efficient scheduling of parallelism with synchronization variablesSPAA '97 Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, 1997
Guy Blelloch and Girija Narlikar.
A Practical Comparison of N-Body Algorithms.
Proceedings DIMACS implementation challenge, 1997.
A provable time and space efficient implementation of NESLICFP '96 Proceedings of the first ACM SIGPLAN international conference on Functional programming, 1996
Developing a practical projection-based parallel Delaunay algorithmSCG '96 Proceedings of the twelfth annual symposium on Computational geometry, 1996
A provably time-efficient parallel implementation of full speculationPOPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 1996
Parallelism in sequential functional languagesFPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995
Provably efficient scheduling for languages with fine-grained parallelismSPAA '95 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, 1995
Accounting for memory bank contention and delay in high-bandwidth multiprocessorsSPAA '95 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, 1995
Guy E. Blelloch, Siddhartha Chatterjee, and Marco Zagha.
Solving Linear Recurrences with Loop Raking.
Journal of Parallel and Distributed Computing (JPDC), February 1995.
Guy E. Blelloch, Siddhartha Chatterjee, Jonathan C. Hardwick, Jay Sipelstein,
and Marco Zagha.
Implementation
of a Portable Nested Data-Parallel Language.
Journal of Parallel and Distributed Computing (JPDC), 21(1), April 1994.
Guy Blelloch and John Greiner.
A Parallel Complexity Model for Functional Languages.
Carnegie Mellon Technical Report: CMU-CS-94-196. October, 1994.
Implementation of a portable nested data-parallel languagePPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, 1993
Radix sort for vector multiprocessorsSupercomputing '91 Proceedings of the 1991 ACM/IEEE conference on Supercomputing, 1991
A comparison of sorting algorithms for the connection machine CM-2SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, 1991
Size and access inference for data-parallel programsPLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, 1991
Guy E. Blelloch.
Prefix Sums and Their Applications.
In "Synthesis of Parallel Algorithms", Edited by John H. Reif, Morgan Kaufmann,
1991.
Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Gregory Plaxton, Stephen J. Smith, and Marco Zagha.
A Comparison of Sorting Algorithms for the Connection Machine CM-2.
ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1991.
Siddhartha Chatterjee, Guy E. Blelloch, Marco Zagha.
Scan primitives for vector computers.
Supercomputing 1990. November 1990.
Four vector-matrix primitivesSPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures, 1989
Guy E. Blelloch.
Nesl: A Nested Data-Parallel Language (Version 3.1)
Carnegie Mellon Technical Report: CMU-CS-95-170. September, 1995.
Guy E. Blelloch.
Nesl: A Nested Data-Parallel Language (Version 2.6)
Carnegie Mellon Technical Report: CMU-CS-93-129. April, 1993.
Guy E. Blelloch.
Nesl: A Nested Data-Parallel Language
Carnegie Mellon Technical Report: CMU-CS-92-103. January, 1992.
Guy Blelloch.
Vector Models for Data-Parallel Computing.
MIT Press. ISBN 0-262-02313-X. 1990.
(Thanks to John Owens for
getting the 16 year old LaTeX running to make this work.)