Search the dblp DataBase
Guy E. Blelloch: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Guy E. Blelloch
CIS: A Massively Concurrent Rule-Based System. [Citation Graph (1, 0)][DBLP]
AAAI, 1986, pp:735-741 [Conf] - 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. [Citation Graph (1, 0)][DBLP]
SPAA, 1991, pp:3-16 [Conf] - Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
An Experimental Analysis of a Compact Graph Representation. [Citation Graph (0, 0)][DBLP]
ALENEX/ANALC, 2004, pp:49-61 [Conf] - Umut A. Acar, Guy E. Blelloch, Jorge L. Vittes
An Experimental Analysis of Change Propagation in Dynamic Trees. [Citation Graph (0, 0)][DBLP]
ALENEX/ANALCO, 2005, pp:41-54 [Conf] - Daniel K. Blandford, Guy E. Blelloch, Clemens Kadow
Engineering a compact parallel delaunay algorithm in 3D. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2006, pp:292-300 [Conf] - Guy E. Blelloch, Gary L. Miller, Dafna Talmor
Developing a Practical Projection-Based Parallel Delaunay Algorithm. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 1996, pp:186-195 [Conf] - Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan
Kinetic 3D convex hulls via self-adjusting computation. [Citation Graph (0, 0)][DBLP]
Symposium on Computational Geometry, 2007, pp:129-130 [Conf] - Daniel K. Blandford, Guy E. Blelloch
Index Compression through Document Reordering. [Citation Graph (0, 0)][DBLP]
DCC, 2002, pp:342-351 [Conf] - Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes
Kinetic Algorithms Via Self-adjusting Computation. [Citation Graph (0, 0)][DBLP]
ESA, 2006, pp:636-647 [Conf] - Guy E. Blelloch, John Greiner
Parallelism in Sequential Functional Languages. [Citation Graph (0, 0)][DBLP]
FPCA, 1995, pp:226-237 [Conf] - Guy E. Blelloch, Kedar Dhamdhere, Eran Halperin, R. Ravi, Russell Schwartz, Srinath Sridhar
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction. [Citation Graph (0, 0)][DBLP]
ICALP (1), 2006, pp:667-678 [Conf] - Srinath Sridhar, Kedar Dhamdhere, Guy E. Blelloch, Eran Halperin, R. Ravi, Russell Schwartz
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees. [Citation Graph (0, 0)][DBLP]
International Conference on Computational Science (2), 2006, pp:799-806 [Conf] - Guy E. Blelloch, John Greiner
A Provable Time and Space Efficient Implementation of NESL. [Citation Graph (0, 0)][DBLP]
ICFP, 1996, pp:213-225 [Conf] - Aleksandar Nanevski, Guy E. Blelloch, Robert Harper
Automatic Generation of Staged Geometric Predicates. [Citation Graph (0, 0)][DBLP]
ICFP, 2001, pp:217-228 [Conf] - Guy E. Blelloch
Scans as Primitive Parallel Operations. [Citation Graph (0, 0)][DBLP]
ICPP, 1987, pp:355-362 [Conf] - Guy E. Blelloch, Charles R. Rosenberg
Network Learning on the Connection Machine. [Citation Graph (0, 0)][DBLP]
IJCAI, 1987, pp:323-326 [Conf] - Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow
Compact Representations of Simplicial Meshes in Two and Three Dimensions. [Citation Graph (0, 0)][DBLP]
IMR, 2003, pp:135-146 [Conf] - Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha
Solving Linear Recurrences with Loop Raking. [Citation Graph (0, 0)][DBLP]
IPPS, 1992, pp:416-424 [Conf] - Guy E. Blelloch, Perry Cheng
On bounding time and space for multiprocessor garbage collection (with retrospective) [Citation Graph (0, 0)][DBLP]
Best of PLDI, 1999, pp:626-641 [Conf] - Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kanat Tangwongsan
An experimental analysis of self-adjusting computation. [Citation Graph (0, 0)][DBLP]
PLDI, 2006, pp:96-107 [Conf] - Guy E. Blelloch, Perry Cheng
On Bounding Time and Space for Multiprocessor Garbage Collection. [Citation Graph (0, 0)][DBLP]
PLDI, 1999, pp:104-117 [Conf] - Siddhartha Chatterjee, Guy E. Blelloch, Allan L. Fisher
Size and Access Inference for Data-Parallel Programs. [Citation Graph (0, 0)][DBLP]
PLDI, 1991, pp:130-144 [Conf] - Perry Cheng, Guy E. Blelloch
A Parallel, Real-Time Garbage Collector. [Citation Graph (0, 0)][DBLP]
PLDI, 2001, pp:125-136 [Conf] - Umut A. Acar, Guy E. Blelloch, Robert Harper
Adaptive functional programming. [Citation Graph (0, 0)][DBLP]
POPL, 2002, pp:247-259 [Conf] - Umut A. Acar, Guy E. Blelloch, Robert Harper
Selective memoization. [Citation Graph (0, 0)][DBLP]
POPL, 2003, pp:14-25 [Conf] - John Greiner, Guy E. Blelloch
A Provably Time-Efficient Parallel Implementation of Full Speculation. [Citation Graph (0, 0)][DBLP]
POPL, 1996, pp:309-321 [Conf] - Guy E. Blelloch, Siddhartha Chatterjee, Jonathan C. Hardwick, Jay Sipelstein, Marco Zagha
Implementation of a Portable Nested Data-Parallel Language. [Citation Graph (0, 0)][DBLP]
PPOPP, 1993, pp:102-111 [Conf] - Girija J. Narlikar, Guy E. Blelloch
Space-Efficient Implementation of Nested Parallelism. [Citation Graph (0, 0)][DBLP]
PPOPP, 1997, pp:25-36 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
SC, 2000, pp:- [Conf] - Siddhartha Chatterjee, Guy E. Blelloch, Marco Zagha
Scan primitives for vector computers. [Citation Graph (0, 0)][DBLP]
SC, 1990, pp:666-675 [Conf] - Marco Zagha, Guy E. Blelloch
Radix sort for vector multiprocessors. [Citation Graph (0, 0)][DBLP]
SC, 1991, pp:712-721 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
SODA, 2004, pp:531-540 [Conf] - Daniel K. Blandford, Guy E. Blelloch
Compact representations of ordered sets. [Citation Graph (0, 0)][DBLP]
SODA, 2004, pp:11-19 [Conf] - Daniel K. Blandford, Guy E. Blelloch
Dictionaries using variable-length keys and data, with applications. [Citation Graph (0, 0)][DBLP]
SODA, 2005, pp:1-10 [Conf] - Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash
Compact representations of separable graphs. [Citation Graph (0, 0)][DBLP]
SODA, 2003, pp:679-688 [Conf] - Guy E. Blelloch, Bruce M. Maggs, Shan Leung Maverick Woo
Space-efficient finger search on degree-balanced search trees. [Citation Graph (0, 0)][DBLP]
SODA, 2003, pp:374-383 [Conf] - Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe
The data locality of work stealing. [Citation Graph (0, 0)][DBLP]
SPAA, 2000, pp:1-12 [Conf] - A. Agrawal, Guy E. Blelloch, Robert L. Krawitz, C. A. Phillips
Four Vector-Matrix Primitives. [Citation Graph (0, 0)][DBLP]
SPAA, 1989, pp:292-302 [Conf] - Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons
Room synchronizations. [Citation Graph (0, 0)][DBLP]
SPAA, 2001, pp:122-133 [Conf] - Guy E. Blelloch, Phillip B. Gibbons
Effectively sharing a cache among threads. [Citation Graph (0, 0)][DBLP]
SPAA, 2004, pp:235-244 [Conf] - Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:1-12 [Conf] - Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. [Citation Graph (0, 0)][DBLP]
SPAA, 1995, pp:84-94 [Conf] - Guy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, Yossi Matias
Space-Efficient Scheduling of Parallelism with Synchronization Variables. [Citation Graph (0, 0)][DBLP]
SPAA, 1997, pp:12-23 [Conf] - Guy E. Blelloch, Margaret Reid-Miller
Pipelining with Futures. [Citation Graph (0, 0)][DBLP]
SPAA, 1997, pp:249-259 [Conf] - Guy E. Blelloch, Margaret Reid-Miller
Fast Set Operations Using Treaps. [Citation Graph (0, 0)][DBLP]
SPAA, 1998, pp:16-26 [Conf] - 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. [Citation Graph (0, 0)][DBLP]
SPAA, 2006, pp:330- [Conf] - Daniel Spoonhower, Guy E. Blelloch, Robert Harper
Using page residency to balance tradeoffs in tracing garbage collection. [Citation Graph (0, 0)][DBLP]
VEE, 2005, pp:57-67 [Conf] - Guy E. Blelloch, Jonathan C. Hardwick, Gary L. Miller, Dafna Talmor
Design and Implementation of a Practical Parallel Delaunay Algorithm. [Citation Graph (0, 0)][DBLP]
Algorithmica, 1999, v:24, n:3-4, pp:243-269 [Journal] - Guy E. Blelloch
Programming Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
Commun. ACM, 1996, v:39, n:3, pp:85-97 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
Commun. ACM, 1996, v:39, n:12es, pp:273-297 [Journal] - Guy E. Blelloch, Bruce M. Maggs
Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
ACM Comput. Surv., 1996, v:28, n:1, pp:51-54 [Journal] - Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper, Kanat Tangwongsan
A Library for Self-Adjusting Computation. [Citation Graph (0, 0)][DBLP]
Electr. Notes Theor. Comput. Sci., 2006, v:148, n:2, pp:127-154 [Journal] - Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow
Compact representations of simplicial meshes in two and three dimensions. [Citation Graph (0, 0)][DBLP]
Int. J. Comput. Geometry Appl., 2005, v:15, n:1, pp:3-24 [Journal] - Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. [Citation Graph (0, 0)][DBLP]
J. ACM, 1999, v:46, n:2, pp:281-321 [Journal] - Guy E. Blelloch, James J. Little
Parallel Solutions to Geometric Problems in the Scan Model of Computation. [Citation Graph (0, 0)][DBLP]
J. Comput. Syst. Sci., 1994, v:48, n:1, pp:90-115 [Journal] - Guy E. Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary L. Miller, Noel Walkington
Persistent triangulations Journal of Functional Programming. [Citation Graph (0, 0)][DBLP]
J. Funct. Program., 2001, v:11, n:5, pp:441-466 [Journal] - Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha
Solving Linear Recurrences with Loop Raking. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1995, v:25, n:1, pp:91-97 [Journal] - Guy E. Blelloch, Gary Sabot
Compiling Collection-Oriented Languages onto Massively Parallel Computers. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1990, v:8, n:2, pp:119-134 [Journal] - Guy E. Blelloch, Jonathan C. Hardwick, Jay Sipelstein, Marco Zagha, Siddhartha Chatterjee
Implementation of a Portable Nested Data-Parallel Language. [Citation Graph (0, 0)][DBLP]
J. Parallel Distrib. Comput., 1994, v:21, n:1, pp:4-14 [Journal] - Aleksandar Nanevski, Guy E. Blelloch, Robert Harper
Automatic Generation of Staged Geometric Predicates. [Citation Graph (0, 0)][DBLP]
Higher-Order and Symbolic Computation, 2003, v:16, n:4, pp:379-400 [Journal] - Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe
The Data Locality of Work Stealing. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2002, v:35, n:3, pp:321-347 [Journal] - Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons
Scalable Room Synchronizations. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 2003, v:36, n:5, pp:397-430 [Journal] - Guy E. Blelloch, Charles E. Leiserson
An Experimental Analysis of Parallel. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 1998, v:31, n:2, pp:135-167 [Journal] - Guy E. Blelloch, Margaret Reid-Miller
Pipelining with Futures. [Citation Graph (0, 0)][DBLP]
Theory Comput. Syst., 1999, v:32, n:3, pp:213-239 [Journal] - James J. Little, Guy E. Blelloch, Todd A. Cass
Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Pattern Anal. Mach. Intell., 1989, v:11, n:3, pp:244-257 [Journal] - Guy E. Blelloch
Scans as Primitive Parallel Operations. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Computers, 1989, v:38, n:11, pp:1526-1538 [Journal] - John Greiner, Guy E. Blelloch
A Provably Time-Efficient Parallel Implementation of Full Speculation. [Citation Graph (0, 0)][DBLP]
ACM Trans. Program. Lang. Syst., 1999, v:21, n:2, pp:240-285 [Journal] - Girija J. Narlikar, Guy E. Blelloch
Space-Efficient Scheduling of Nested Parallelism. [Citation Graph (0, 0)][DBLP]
ACM Trans. Program. Lang. Syst., 1999, v:21, n:1, pp:138-173 [Journal] - Umut A. Acar, Guy E. Blelloch, Robert Harper
Adaptive functional programming. [Citation Graph (0, 0)][DBLP]
ACM Trans. Program. Lang. Syst., 2006, v:28, n:6, pp:990-1034 [Journal] - Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. [Citation Graph (0, 0)][DBLP]
IEEE Trans. Parallel Distrib. Syst., 1997, v:8, n:9, pp:943-958 [Journal] - 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. [Citation Graph (0, 0)][DBLP]
SPAA, 2007, pp:105-115 [Conf] - Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz
Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming. [Citation Graph (0, 0)][DBLP]
ISBRA, 2007, pp:37-48 [Conf]
Succinct Representations of Separable Graphs. [Citation Graph (, )][DBLP]
Robust Kinetic Convex Hulls in 3D. [Citation Graph (, )][DBLP]
Strongly History-Independent Hashing with Applications. [Citation Graph (, )][DBLP]
A New Combinatorial Approach for Sparse Graph Problems. [Citation Graph (, )][DBLP]
Space profiling for parallel functional programs. [Citation Graph (, )][DBLP]
Traceable data types for self-adjusting computation. [Citation Graph (, )][DBLP]
Parallel thinking. [Citation Graph (, )][DBLP]
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. [Citation Graph (, )][DBLP]
Provably good multicore cache performance for divide-and-conquer algorithms. [Citation Graph (, )][DBLP]
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. [Citation Graph (, )][DBLP]
Brief announcement: low depth cache-oblivious sorting. [Citation Graph (, )][DBLP]
Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures. [Citation Graph (, )][DBLP]
Combinable memory-block transactions. [Citation Graph (, )][DBLP]
Parallel approximation algorithms for facility-location problems. [Citation Graph (, )][DBLP]
Low depth cache-oblivious algorithms. [Citation Graph (, )][DBLP]
Uniquely Represented Data Structures for Computational Geometry. [Citation Graph (, )][DBLP]
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure. [Citation Graph (, )][DBLP]
Direct maximum parsimony phylogeny reconstruction from genotype data. [Citation Graph (, )][DBLP]
Parallel Approximation Algorithms for Facility-Location Problems [Citation Graph (, )][DBLP]
Search in 0.007secs, Finished in 0.011secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002