2009 | ||
---|---|---|
87 | EE | Guy E. Blelloch: Parallel thinking. PPOPP 2009: 1-2 |
2008 | ||
86 | EE | Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkoglu: Robust Kinetic Convex Hulls in 3D. ESA 2008: 29-40 |
85 | EE | Guy E. Blelloch, Virginia Vassilevska, Ryan Williams: A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) 2008: 108-120 |
84 | EE | Daniel Spoonhower, Guy E. Blelloch, Robert Harper, Phillip B. Gibbons: Space profiling for parallel functional programs. ICFP 2008: 253-264 |
83 | EE | 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 |
82 | EE | Guy E. Blelloch: Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. SODA 2008: 894-903 |
81 | EE | Guy E. Blelloch, Phillip B. Gibbons, S. Harsha Vardhan: Combinable memory-block transactions. SPAA 2008: 23-34 |
80 | EE | Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska: Uniquely Represented Data Structures for Computational Geometry. SWAT 2008: 17-28 |
79 | EE | Daniel K. Blandford, Guy E. Blelloch: Compact dictionaries for variable-length keys and data with applications. ACM Transactions on Algorithms 4(2): (2008) |
78 | EE | 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) |
2007 | ||
77 | Neal Glew, Guy E. Blelloch: Proceedings of the POPL 2007 Workshop on Declarative Aspects of Multicore Programming, DAMP 2007, Nice, France, January 16, 2007 ACM 2007 | |
76 | EE | Guy E. Blelloch, Daniel Golovin: Strongly History-Independent Hashing with Applications. FOCS 2007: 272-282 |
75 | EE | 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 |
74 | EE | 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 |
73 | EE | Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan: Kinetic 3D convex hulls via self-adjusting computation. Symposium on Computational Geometry 2007: 129-130 |
72 | EE | 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) |
2006 | ||
71 | EE | Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes: Kinetic Algorithms Via Self-adjusting Computation. ESA 2006: 636-647 |
70 | EE | 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 |
69 | EE | 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 |
68 | EE | Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kanat Tangwongsan: An experimental analysis of self-adjusting computation. PLDI 2006: 96-107 |
67 | EE | 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 |
66 | EE | Daniel K. Blandford, Guy E. Blelloch, Clemens Kadow: Engineering a compact parallel delaunay algorithm in 3D. Symposium on Computational Geometry 2006: 292-300 |
65 | EE | Umut A. Acar, Guy E. Blelloch, Robert Harper: Adaptive functional programming. ACM Trans. Program. Lang. Syst. 28(6): 990-1034 (2006) |
64 | EE | 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) |
2005 | ||
63 | EE | Umut A. Acar, Guy E. Blelloch, Jorge L. Vittes: An Experimental Analysis of Change Propagation in Dynamic Trees. ALENEX/ANALCO 2005: 41-54 |
62 | EE | Daniel K. Blandford, Guy E. Blelloch: Dictionaries using variable-length keys and data, with applications. SODA 2005: 1-10 |
61 | EE | Daniel Spoonhower, Guy E. Blelloch, Robert Harper: Using page residency to balance tradeoffs in tracing garbage collection. VEE 2005: 57-67 |
60 | EE | 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) |
2004 | ||
59 | Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash: An Experimental Analysis of a Compact Graph Representation. ALENEX/ANALC 2004: 49-61 | |
58 | EE | Daniel K. Blandford, Guy E. Blelloch: Compact representations of ordered sets. SODA 2004: 11-19 |
57 | EE | 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 |
56 | EE | Guy E. Blelloch, Phillip B. Gibbons: Effectively sharing a cache among threads. SPAA 2004: 235-244 |
2003 | ||
55 | EE | 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 |
54 | EE | Umut A. Acar, Guy E. Blelloch, Robert Harper: Selective memoization. POPL 2003: 14-25 |
53 | EE | Guy E. Blelloch, Bruce M. Maggs, Shan Leung Maverick Woo: Space-efficient finger search on degree-balanced search trees. SODA 2003: 374-383 |
52 | EE | Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash: Compact representations of separable graphs. SODA 2003: 679-688 |
51 | EE | Aleksandar Nanevski, Guy E. Blelloch, Robert Harper: Automatic Generation of Staged Geometric Predicates. Higher-Order and Symbolic Computation 16(4): 379-400 (2003) |
50 | EE | Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons: Scalable Room Synchronizations. Theory Comput. Syst. 36(5): 397-430 (2003) |
2002 | ||
49 | EE | Daniel K. Blandford, Guy E. Blelloch: Index Compression through Document Reordering. DCC 2002: 342-351 |
48 | EE | Umut A. Acar, Guy E. Blelloch, Robert Harper: Adaptive functional programming. POPL 2002: 247-259 |
47 | EE | Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe: The Data Locality of Work Stealing. Theory Comput. Syst. 35(3): 321-347 (2002) |
2001 | ||
46 | Aleksandar Nanevski, Guy E. Blelloch, Robert Harper: Automatic Generation of Staged Geometric Predicates. ICFP 2001: 217-228 | |
45 | Perry Cheng, Guy E. Blelloch: A Parallel, Real-Time Garbage Collector. PLDI 2001: 125-136 | |
44 | EE | Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons: Room synchronizations. SPAA 2001: 122-133 |
43 | 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) | |
2000 | ||
42 | EE | 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 |
41 | EE | Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe: The data locality of work stealing. SPAA 2000: 1-12 |
1999 | ||
40 | EE | Guy E. Blelloch, Perry Cheng: On bounding time and space for multiprocessor garbage collection (with retrospective) Best of PLDI 1999: 626-641 |
39 | EE | Guy E. Blelloch, Perry Cheng: On Bounding Time and Space for Multiprocessor Garbage Collection. PLDI 1999: 104-117 |
38 | EE | Girija J. Narlikar, Guy E. Blelloch: Space-Efficient Scheduling of Nested Parallelism. ACM Trans. Program. Lang. Syst. 21(1): 138-173 (1999) |
37 | EE | John Greiner, Guy E. Blelloch: A Provably Time-Efficient Parallel Implementation of Full Speculation. ACM Trans. Program. Lang. Syst. 21(2): 240-285 (1999) |
36 | EE | 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) |
35 | EE | Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias: Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. J. ACM 46(2): 281-321 (1999) |
34 | EE | Guy E. Blelloch, Margaret Reid-Miller: Pipelining with Futures. Theory Comput. Syst. 32(3): 213-239 (1999) |
1998 | ||
33 | EE | Guy E. Blelloch, Margaret Reid-Miller: Fast Set Operations Using Treaps. SPAA 1998: 16-26 |
32 | Guy E. Blelloch, Charles E. Leiserson: An Experimental Analysis of Parallel. Theory Comput. Syst. 31(2): 135-167 (1998) | |
1997 | ||
31 | Girija J. Narlikar, Guy E. Blelloch: Space-Efficient Implementation of Nested Parallelism. PPOPP 1997: 25-36 | |
30 | EE | Guy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, Yossi Matias: Space-Efficient Scheduling of Parallelism with Synchronization Variables. SPAA 1997: 12-23 |
29 | EE | Guy E. Blelloch, Margaret Reid-Miller: Pipelining with Futures. SPAA 1997: 249-259 |
28 | Guy E. Blelloch, Bruce M. Maggs: Parallel Algorithms. The Computer Science and Engineering Handbook 1997: 277-315 | |
27 | EE | 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) |
1996 | ||
26 | Guy E. Blelloch, John Greiner: A Provable Time and Space Efficient Implementation of NESL. ICFP 1996: 213-225 | |
25 | EE | John Greiner, Guy E. Blelloch: A Provably Time-Efficient Parallel Implementation of Full Speculation. POPL 1996: 309-321 |
24 | EE | Guy E. Blelloch, Gary L. Miller, Dafna Talmor: Developing a Practical Projection-Based Parallel Delaunay Algorithm. Symposium on Computational Geometry 1996: 186-195 |
23 | Guy E. Blelloch, Bruce M. Maggs: Parallel Algorithms. ACM Comput. Surv. 28(1): 51-54 (1996) | |
22 | 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) | |
21 | Guy E. Blelloch: Programming Parallel Algorithms. Commun. ACM 39(3): 85-97 (1996) | |
1995 | ||
20 | Guy E. Blelloch, John Greiner: Parallelism in Sequential Functional Languages. FPCA 1995: 226-237 | |
19 | EE | Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias: Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. SPAA 1995: 1-12 |
18 | EE | 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 |
17 | Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha: Solving Linear Recurrences with Loop Raking. J. Parallel Distrib. Comput. 25(1): 91-97 (1995) | |
1994 | ||
16 | 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) | |
15 | 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) | |
1993 | ||
14 | Guy E. Blelloch, Siddhartha Chatterjee, Jonathan C. Hardwick, Jay Sipelstein, Marco Zagha: Implementation of a Portable Nested Data-Parallel Language. PPOPP 1993: 102-111 | |
1992 | ||
13 | Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha: Solving Linear Recurrences with Loop Raking. IPPS 1992: 416-424 | |
1991 | ||
12 | Siddhartha Chatterjee, Guy E. Blelloch, Allan L. Fisher: Size and Access Inference for Data-Parallel Programs. PLDI 1991: 130-144 | |
11 | EE | Marco Zagha, Guy E. Blelloch: Radix sort for vector multiprocessors. SC 1991: 712-721 |
10 | EE | 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 |
1990 | ||
9 | Guy E. Blelloch: Vector Models for Data-Parallel Computing MIT Press 1990 | |
8 | EE | Siddhartha Chatterjee, Guy E. Blelloch, Marco Zagha: Scan primitives for vector computers. SC 1990: 666-675 |
7 | Guy E. Blelloch, Gary Sabot: Compiling Collection-Oriented Languages onto Massively Parallel Computers. J. Parallel Distrib. Comput. 8(2): 119-134 (1990) | |
1989 | ||
6 | EE | A. Agrawal, Guy E. Blelloch, Robert L. Krawitz, C. A. Phillips: Four Vector-Matrix Primitives. SPAA 1989: 292-302 |
5 | Guy E. Blelloch: Scans as Primitive Parallel Operations. IEEE Trans. Computers 38(11): 1526-1538 (1989) | |
4 | EE | 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) |
1987 | ||
3 | Guy E. Blelloch: Scans as Primitive Parallel Operations. ICPP 1987: 355-362 | |
2 | Guy E. Blelloch, Charles R. Rosenberg: Network Learning on the Connection Machine. IJCAI 1987: 323-326 | |
1986 | ||
1 | Guy E. Blelloch: CIS: A Massively Concurrent Rule-Based System. AAAI 1986: 735-741 |