- Guy E. Blelloch In the past 20 years there has been treftlen-
- Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid
- Parallelism in Sequential Functional Languages Guy Blelloch (blelloch@cs. emu. edu)
- A New Combinatorial Approach for Sparse Graph Problems
- An Experimental Analysis of Self-Adjusting Computation Umut A. Acar
- A Provably Time-Efficient Parallel Implementation of' Full Speculation John Greiner and Guy E. Blelloch
- An Experimental Analysis of a Compact Graph Representation Daniel K. Blandford Guy E. Blelloch Ian A. Kash
- Compact Representations of Separable Graphs Daniel K. Blandford Guy E. Blelloch Ian A. Kash
- Scan Primitives for Vector Computers* Siddhartha Chatterjee Guy E. Blelloch
- Dictionaries Using Variable-Length Keys and Data, with Applications *
- Linear-Work Greedy Parallel Approximate Set Cover and Variants
- PPoPP, 2/16/2009 1 Parallel Thinking*
- Brief Announcement: Low Depth Cache-Oblivious Sorting Guy E. Blelloch
- Robust Kinetic Convex Hulls in 3D Umut A. Acar1
- Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference
- Succinct Representations of Separable Graphs Guy E. Blelloch1
- A Provable Time and Space Efficient Implementation of NESL Guy E. Blelloch and John Greiner
- Kinetic Algorithms Via Self-adjusting Computation Umut A. Acar1
- Beyond Nested Parallelism: Tight Bounds on Work-Stealing Overheads for Parallel Futures
- A Parallel, Real-Time Garbage Collector Perry Cheng Guy E. Blelloch
- An Experimental Analysis of Self-Adjusting Computation
- Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory
- Engineering a Compact Parallel Delaunay Algorithm in 3D Daniel K. Blandford
- A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction
- HigherOrder and Symbolic Computation, 16, 379--400, 2003 # 2003 Kluwer Academic Publishers. Manufactured in The Netherlands.
- JFP: page 1 of 45. c Cambridge University Press 2010 doi:10.1017/S0956796810000146
- Scheduling Irregular Parallel Computations on Hierarchical Caches
- Near Linear-Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs
- Parallel Approximation Algorithms for Facility-Location Guy E. Blelloch Kanat Tangwongsan
- Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny
- Space Profiling for Parallel Functional Programs Daniel Spoonhower Guy E. Blelloch
- Compact Dictionaries for Variable-Length Keys and Data, with Applications
- Space-Efficient Dynamic Orthogonal Point Location, Segment Intersection, and Range Reporting
- Strongly History-Independent Hashing with Applications Guy E. Blelloch
- Scheduling Threads for Constructive Cache Sharing on CMPs
- Kinetic 3D Convex Hulls via Self-Adjusting Computation (An Illustration)
- Efficiently Finding the Most Parsimonious Phylogenetic Tree via Linear Programming
- May 24, 2006 21:34 WSPC/Trim Size: 11in x 8.5in for Proceedings ipphformatted OPTIMAL IMPERFECT PHYLOGENY RECONSTRUCTION AND HAPLOTYPING (IPPH)
- Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction
- Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees
- Using Page Residency to Balance Tradeoffs in Tracing Garbage Collection
- Effectively Sharing a Cache Among Threads Guy E. Blelloch
- Selective Memoization Umut A. Acar Guy E. Blelloch Robert Harper
- Space-Efficient Finger Search on Degree-Balanced Search Trees Guy E. Blelloch Bruce M. Maggs Shan Leung Maverick Woo
- Room Synchronizations Guy E. Blelloch Perry Cheng
- Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
- Algorithmica (1999) 24: 243269 Algorithmica
- Theory Comput. Systems 32, 213239 (1999) 1999 Springer-Verlag
- Prefix Sums and Their Applications
- Nesl: A Nested Data-Parallel Language (Version 3.1)
- Nesl: A Nested Data-Parallel Language (Version 2.6)
- Nesl: A Nested Data-Parallel Language Guy E. Blelloch
- Func%onal Parallel Algorithms Guy Blelloch
- IBM Watson, Nov. 2008 1 Parallel Scheduling
- Combinable Memory-Block Transactions Guy E. Blelloch
- Uniquely Represented Data Structures for Computational Geometry
- An Optimization-Based Sampling Scheme for Phylogenetic Trees
- MPI, 2010 1 Algorithms for Parallel
- A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting
- DOI: 10.1007/s00224-003-1081-y Theory Comput. Systems OF1OF34 (2003)
- Space-Efficient Scheduling of Nested Parallelism GIRIJA J. NARLIKAR and GUY E. BLELLOCH
- Low Depth Cache-Oblivious Algorithms Guy E. Blelloch
- A Provably Time-Efficient Parallel Implementation of Full Speculation
- Vector Models for Data-Parallel Computing Guy E. Blelloch
- Low Depth Cache-Oblivious Algorithms Guy E. Blelloch
- Provably Good Multicore Cache Performance for Divide-and-Conquer Algorithms
- COMPACT REPRESENTATIONS OF ORDERED SETS Daniel K. Blandford
- Parallel Algorithms Guy E. Blelloch and Bruce M. Maggs
- Internally Deterministic Parallel Algorithms Can Be Fast Guy E. Blelloch Jeremy T. Fineman Phillip B. Gibbons Julian Shun
