Guy E. Blelloch

Guy E. Blelloch, Robert Harper: Cache and I/O efficent functional algorithms. POPL 2013: 39-50

Julian Shun, Guy E. Blelloch: Ligra: a lightweight graph processing framework for shared memory. PPOPP 2013: 135-146

Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons: Reducing contention through priority updates. PPOPP 2013: 299-300

Guy E. Blelloch, Dan Halperin: Introduction to special issue ALENEX'10. ACM Journal of Experimental Algorithmics 17(1) (2012)

Guy E. Blelloch: Problem Based Benchmarks. ANALCO 2012

Ming-Chi Tsai, Guy E. Blelloch, Russell Schwartz, R. Ravi: Coalescent-based method for learning parameters of admixture events from large-scale genetic variation data. BCB 2012: 90-97

Ruy Ley-Wild, Umut A. Acar, Guy E. Blelloch: Non-monotonic Self-Adjusting Computation. ESOP 2012: 476-496

Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Julian Shun: Internally deterministic parallel algorithms can be fast. PPOPP 2012: 181-192

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: 68-70

Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan: Parallel and I/O efficient set covering algorithms. SPAA 2012: 82-90

Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan: Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. SPAA 2012: 205-213

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

Guy E. Blelloch, Maurice Herlihy (Eds.): 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '12, Pittsburgh, PA, USA, June 25-27, 2012. ACM 2012, isbn 978-1-4503-1213-4

Guy E. Blelloch, Jeremy T. Fineman, Julian Shun: Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR abs/1202.3205 (2012)

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny. Journal of Computational Biology 18(3): 445-457 (2011)

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: An Optimization-Based Sampling Scheme for Phylogenetic Trees. Journal of Computational Biology 18(11): 1599-1609 (2011)

Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz: A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. IEEE/ACM Trans. Comput. Biology Bioinform. 8(4): 918-928 (2011)

Guy E. Blelloch, Julian Shun: A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. ALENEX 2011: 48-58

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: An Optimization-Based Sampling Scheme for Phylogenetic Trees. RECOMB 2011: 252-266

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

Guy E. Blelloch, Richard Peng, Kanat Tangwongsan: Linear-work greedy parallel approximate set cover and variants. SPAA 2011: 23-32

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

Guy E. Blelloch: NESL. Encyclopedia of Parallel Computing 2011: 1278-1283

Umut A. Acar, Guy E. Blelloch, Robert Harper: Selective Memoization. CoRR abs/1106.0447 (2011)

Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan: Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. CoRR abs/1111.1750 (2011)

Guy E. Blelloch, Arash Farzan: Succinct Representations of Separable Graphs. CPM 2010: 138-150

Guy E. Blelloch: Functional parallel algorithms. ICFP 2010: 247-248

Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz: A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. ISBRA 2010: 167-178

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

Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz: Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. RECOMB 2010: 369-383

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

Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri: Low depth cache-oblivious algorithms. SPAA 2010: 189-199

Guy E. Blelloch, Kanat Tangwongsan: Parallel approximation algorithms for facility-location problems. SPAA 2010: 315-324

Guy E. Blelloch, Dan Halperin (Eds.): Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments, ALENEX 2010, Austin, Texas, USA, January 16, 2010. SIAM 2010, isbn 978-0-898719-31-4

Guy E. Blelloch, Kanat Tangwongsan: Parallel Approximation Algorithms for Facility-Location Problems. CoRR abs/1006.1923 (2010)

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

Guy E. Blelloch: Parallel thinking. PPOPP 2009: 1-2

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

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

Daniel Spoonhower, Guy E. Blelloch, Robert Harper, Phillip B. Gibbons: Space profiling for parallel functional programs. J. Funct. Program. 20(5-6): 417-461 (2008)

Daniel K. Blandford, Guy E. Blelloch: Compact dictionaries for variable-length keys and data with applications. ACM Transactions on Algorithms 4(2) (2008)

Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz: Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference. IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 323-331 (2008)

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

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

Daniel Spoonhower, Guy E. Blelloch, Robert Harper, Phillip B. Gibbons: Space profiling for parallel functional programs. ICFP 2008: 253-264

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

Guy E. Blelloch: Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. SODA 2008: 894-903

Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri: Combinable memory-block transactions. SPAA 2008: 23-34

Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska: Uniquely Represented Data Structures for Computational Geometry. SWAT 2008: 17-28

Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz: Direct maximum parsimony phylogeny reconstruction from genotype data. BMC Bioinformatics 8 (2007)

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

Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan: Kinetic 3D convex hulls via self-adjusting computation. Symposium on Computational Geometry 2007: 129-130

Guy E. Blelloch, Daniel Golovin: Strongly History-Independent Hashing with Applications. FOCS 2007: 272-282

Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz: Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming. ISBRA 2007: 37-48

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: Scheduling threads for constructive cache sharing on CMPs. SPAA 2007: 105-115

Neal Glew, Guy E. Blelloch (Eds.): Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, DAMP 2007, Nice, France, January 16, 2007. ACM 2007, isbn 978-1-59593-690-5

Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper, Kanat Tangwongsan: A Library for Self-Adjusting Computation. Electr. Notes Theor. Comput. Sci. 148(2): 127-154 (2006)

Umut A. Acar, Guy E. Blelloch, Robert Harper: Adaptive functional programming. ACM Trans. Program. Lang. Syst. 28(6): 990-1034 (2006)

Daniel K. Blandford, Guy E. Blelloch, Clemens Kadow: Engineering a compact parallel delaunay algorithm in 3D. Symposium on Computational Geometry 2006: 292-300

Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes: Kinetic Algorithms Via Self-adjusting Computation. ESA 2006: 636-647

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

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

Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kanat Tangwongsan: An experimental analysis of self-adjusting computation. PLDI 2006: 96-107

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: Parallel depth first vs. work stealing schedulers on CMP architectures. SPAA 2006: 330

Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow: Compact representations of simplicial meshes in two and three dimensions. Int. J. Comput. Geometry Appl. 15(1): 3-24 (2005)

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

Daniel K. Blandford, Guy E. Blelloch: Dictionaries using variable-length keys and data, with applications. SODA 2005: 1-10

Daniel Spoonhower, Guy E. Blelloch, Robert Harper: Using page residency to balance tradeoffs in tracing garbage collection. VEE 2005: 57-67

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

Daniel K. Blandford, Guy E. Blelloch: Compact representations of ordered sets. SODA 2004: 11-19

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

Guy E. Blelloch, Phillip B. Gibbons: Effectively sharing a cache among threads. SPAA 2004: 235-244

Aleksandar Nanevski, Guy E. Blelloch, Robert Harper: Automatic Generation of Staged Geometric Predicates. Higher-Order and Symbolic Computation 16(4): 379-400 (2003)

Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons: Scalable Room Synchronizations. Theory Comput. Syst. 36(5): 397-430 (2003)

Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow: Compact Representations of Simplicial Meshes in Two and Three Dimensions. IMR 2003: 135-146

Umut A. Acar, Guy E. Blelloch, Robert Harper: Selective memoization. POPL 2003: 14-25

Guy E. Blelloch, Bruce M. Maggs, Shan Leung Maverick Woo: Space-efficient finger search on degree-balanced search trees. SODA 2003: 374-383

Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash: Compact representations of separable graphs. SODA 2003: 679-688

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

Daniel K. Blandford, Guy E. Blelloch: Index Compression through Document Reordering. DCC 2002: 342-351

Umut A. Acar, Guy E. Blelloch, Robert Harper: Adaptive functional programming. POPL 2002: 247-259

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

Aleksandar Nanevski, Guy E. Blelloch, Robert Harper: Automatic Generation of Staged Geometric Predicates. ICFP 2001: 217-228

Perry Cheng, Guy E. Blelloch: A Parallel, Real-Time Garbage Collector. PLDI 2001: 125-136

Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons: Room synchronizations. SPAA 2001: 122-133

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

Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe: The data locality of work stealing. SPAA 2000: 1-12

Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor: Design and Implementation of a Practical Parallel Delaunay Algorithm. Algorithmica 24(3-4): 243-269 (1999)

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

Guy E. Blelloch, Margaret Reid-Miller: Pipelining with Futures. Theory Comput. Syst. 32(3): 213-239 (1999)

Girija J. Narlikar, Guy E. Blelloch: Space-Efficient Scheduling of Nested Parallelism. ACM Trans. Program. Lang. Syst. 21(1): 138-173 (1999)

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

Guy E. Blelloch, Perry Cheng: On Bounding Time and Space for Multiprocessor Garbage Collection. PLDI 1999: 104-117

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

Guy E. Blelloch, Charles E. Leiserson: An Experimental Analysis of Parallel. Theory Comput. Syst. 31(2): 135-167 (1998)

Girija J. Narlikar, Guy E. Blelloch: Pthreads for Dynamic and Irregular Parallelism. SC 1998: 31

Guy E. Blelloch, Margaret Reid-Miller: Fast Set Operations Using Treaps. SPAA 1998: 16-26

Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha: Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. IEEE Trans. Parallel Distrib. Syst. 8(9): 943-958 (1997)

Guy E. Blelloch, Bruce M. Maggs: Parallel Algorithms. The Computer Science and Engineering Handbook 1997: 277-315

Girija J. Narlikar, Guy E. Blelloch: Space-Efficient Implementation of Nested Parallelism. PPOPP 1997: 25-36

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

Guy E. Blelloch, Margaret Reid-Miller: Pipelining with Futures. SPAA 1997: 249-259

Guy E. Blelloch: Programming Parallel Algorithms. Commun. ACM 39(3): 85-97 (1996)

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

Guy E. Blelloch, Bruce M. Maggs: Parallel Algorithms. ACM Comput. Surv. 28(1): 51-54 (1996)

Guy E. Blelloch, Gary L. Miller, Dafna Talmor: Developing a Practical Projection-Based Parallel Delaunay Algorithm. Symposium on Computational Geometry 1996: 186-195

Guy E. Blelloch, John Greiner: A Provable Time and Space Efficient Implementation of NESL. ICFP 1996: 213-225

John Greiner, Guy E. Blelloch: A Provably Time-Efficient Parallel Implementation of Full Speculation. POPL 1996: 309-321

Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha: Solving Linear Recurrences with Loop Raking. J. Parallel Distrib. Comput. 25(1): 91-97 (1995)

Guy E. Blelloch, John Greiner: Parallelism in Sequential Functional Languages. FPCA 1995: 226-237

Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias: Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. SPAA 1995: 1-12

Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha: Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. SPAA 1995: 84-94

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

Guy E. Blelloch, Jonathan C. Hardwick, Jay Sipelstein, Marco Zagha, Siddhartha Chatterjee: Implementation of a Portable Nested Data-Parallel Language. J. Parallel Distrib. Comput. 21(1): 4-14 (1994)

Guy E. Blelloch, Siddhartha Chatterjee, Jonathan C. Hardwick, Jay Sipelstein, Marco Zagha: Implementation of a Portable Nested Data-Parallel Language. PPOPP 1993: 102-111

Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha: Solving Linear Recurrences with Loop Raking. IPPS 1992: 416-424

Siddhartha Chatterjee, Guy E. Blelloch, Allan L. Fisher: Size and Access Inference for Data-Parallel Programs. PLDI 1991: 130-144

Marco Zagha, Guy E. Blelloch: Radix sort for vector multiprocessors. SC 1991: 712-721

Guy E. Blelloch, Charles E. Leiserson, Bruce M. Maggs, C. Greg Plaxton, Stephen J. Smith, Marco Zagha: A Comparison of Sorting Algorithms for the Connection Machine CM-2. SPAA 1991: 3-16

Guy E. Blelloch: Vector Models for Data-Parallel Computing. MIT Press 1990, isbn 0-262-02313-X

Guy E. Blelloch, Gary Sabot: Compiling Collection-Oriented Languages onto Massively Parallel Computers. J. Parallel Distrib. Comput. 8(2): 119-134 (1990)

Siddhartha Chatterjee, Guy E. Blelloch, Marco Zagha: Scan primitives for vector computers. SC 1990: 666-675

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

Guy E. Blelloch: Scans as Primitive Parallel Operations. IEEE Trans. Computers 38(11): 1526-1538 (1989)

A. Agrawal, Guy E. Blelloch, Robert L. Krawitz, C. A. Phillips: Four Vector-Matrix Primitives. SPAA 1989: 292-302

Guy E. Blelloch: Scans as Primitive Parallel Operations. ICPP 1987: 355-362

Guy E. Blelloch, Charles R. Rosenberg: Network Learning on the Connection Machine. IJCAI 1987: 323-326

Guy E. Blelloch: CIS: A Massively Concurrent Rule-Based System. AAAI 1986: 735-741