Conference Brief announcement: Parallel depth first vs. work stealing schedulers on CMP architectures 2006 • Annual ACM Symposium on Parallelism in Algorithms and Architectures • 2006:330 Liaskovitis V, Chen S, Gibbons PB, Ailamaki A, Blelloch GE, Falsafi B, Fix L, Hardavellas N, Kozuch M, Mowry TC, Wilkerson C
Conference Engineering a compact parallel delaunay algorithm in 3D 2006 • Proceedings of the Annual Symposium on Computational Geometry • 292-300 Blandford DK, Blelloch GE, Kadow C
Conference Fixed parameter tractability of binary near-perfect phylogenetic tree reconstruction 2006 • Lecture Notes in Computer Science • 4051:667-678 Blelloch GE, Dhamdhere K, Halperin E, Ravi R, Schwartz R, Sridhar S
Conference Kinetic algorithms via self-adjusting computation 2006 • Lecture Notes in Computer Science • 4168:636-647 Acar UA, Blelloch GE, Tangwongsan K, Vittes JL
Journal Article Optimal imperfect phylogeny reconstruction and haplotyping (IPPH). 2006 • Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference • 199-210 Sridhar S, Blelloch GE, Ravi R, Schwartz R
Conference Simple reconstruction of binary near-perfect phylogenetic trees 2006 • Lecture Notes in Computer Science • 3992:799-806 Sridhar S, Dhamdhere K, Blelloch GE, Halperin E, Ravi R, Schwartz R
Conference An experimental analysis of change propagation in dynamic trees 2005 • Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithms and Combinatorics • 41-54 Acar UA, Blelloch GE, Vittes JL
Journal Article Compact representations of simplicial meshes in two and three dimensions 2005 • International Journal of Computational Geometry and Applications • 15(1):3-24 Blandford DK, Blelloch GE, Cardoze DE, Kadow C
Conference Dictionaries Using Variable-Length Keys and Data, with Applications 2005 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 1-10 Blandford DK, Blelloch GE
Conference Using page residency to balance tradeoffs in tracing garbage collection 2005 57-67 Spoonhower D, Blelloch G, Harper R
Conference An experimental analysis of a compact graph representation 2004 • Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithms and Combinatorics • 49-61 Blandford DK, Blelloch GE, Kash IA
Conference Compact representations of ordered sets 2004 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 15:11-19 Blandford DK, Blelloch GE
Conference Dynamizing Static Algorithms, with Applications to Dynamic Trees and History Independence 2004 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 15:524-533 Acar UA, Blelloch GE, Harper R, Vittes JL, Woo SLM
Conference On bounding time and space for multiprocessor garbage collection 2004 • ACM Sigplan Notices • 39(4):626-627 Blelloch GE, Cheng P
Conference On bounding time and space for multiprocessor garbage collection 2004 • ACM Sigplan Notices • 39(4):628-641 Blelloch GE, Cheng P
Journal Article Automatic Generation of Staged Geometric Predicates 2003 • Higher-Order and Symbolic Computation • 16(4):379-400 Nanevski A, Blelloch G, Harper R
Conference Compact representations of separable graphs 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 679-688 Blandford DK, Blelloch GE, Kash IA
Journal Article Scalable room synchronizations 2003 • Theory of Computing Systems • 36(5):397-430 Blelloch GE, Cheng P, Gibbons PB
Conference Selective memoization 2003 • Conference Record of the Annual ACM Symposium on Principles of Programming Languages • 14-25 Acar UA, Blelloch GE, Harper R
Journal Article Selective memoization 2003 • ACM Sigplan Notices • 38(1):14-25 Acar UA, Blelloch GE, Harper R
Conference Space-efficient finger search on degree-balanced search trees 2003 • Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms • 374-383 Blelloch GE, Maggs BM, Woo SLM
Conference Adaptive functional programming 2002 • Conference Record of the Annual ACM Symposium on Principles of Programming Languages • 247-259 Acar UA, Blelloch GE, Harper R
Conference Index Compression Through Document Reordering**This work was supported in part by the National Science Foundation under grants CCR-9706572, CCR-0085982, and CCR-0122581 2002 • Data Compression Conference Proceedings • 342-351 Blandford D, Blelloch G
