default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGuy E. Blelloch
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c169]Naama Ben-David
, Guy E. Blelloch, Yuanhao Wei:
Lock-Free Locks Revisited (Abstract). HOPC@SPAA 2024- [c168]Guy E. Blelloch, Yan Gu, Yihan Sun:
Teaching Parallel Algorithms Using the Binary-Forking Model. IPDPS (Workshops) 2024: 346-351 - [c167]Guy E. Blelloch, Yuanhao Wei:
VERLIB: Concurrent Versioned Pointers. PPoPP 2024: 200-214 - [c166]Magdalen Dobson Manohar, Zheqi Shen, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Harsha Vardhan Simhadri, Yihan Sun:
ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. PPoPP 2024: 270-285 - [c165]Daniel Anderson, Guy E. Blelloch:
Deterministic and Low-Span Work-Efficient Parallel Batch-Dynamic Trees. SPAA 2024: 247-258 - 2023
- [j49]Daniel Anderson, Guy E. Blelloch:
Parallel Minimum Cuts in O(m log2 n) Work and Low Depth. ACM Trans. Parallel Comput. 10(4): 18:1-18:28 (2023) - [c164]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract). HOPC@SPAA 2023: 9-10 - [c163]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-tree: A Skew-resistant Index for Processing-in-Memory (Abstract). HOPC@SPAA 2023: 13-14 - [c162]Guy E. Blelloch, Magdalen Dobson:
The Geometry of Tree-Based Sorting. ICALP 2023: 26:1-26:19 - [c161]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP 2023: 66-78 - [c160]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-trie: A Skew-resistant Trie for Processing-in-Memory. SPAA 2023: 1-14 - [c159]Guy E. Blelloch:
Are Parallel Algorithms Ready for Prime Time? SPAA 2023: 63 - [i46]Magdalen Dobson, Zheqi Shen, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Harsha Vardhan Simhadri, Yihan Sun:
Scaling Graph-Based ANNS Algorithms to Billion-Size Datasets: A Comparative Analysis. CoRR abs/2305.04359 (2023) - [i45]Daniel Anderson, Guy E. Blelloch:
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span. CoRR abs/2306.08786 (2023) - 2022
- [j48]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-tree: A Skew-resistant Index for Processing-in-Memory. Proc. VLDB Endow. 16(4): 946-958 (2022) - [j47]Guy E. Blelloch, Daniel Ferizovic, Yihan Sun:
Joinable Parallel Balanced Binary Trees. ACM Trans. Parallel Comput. 9(2): 7:1-7:41 (2022) - [c158]Guy E. Blelloch, Magdalen Dobson:
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. ALENEX 2022: 195-208 - [c157]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Turning manual concurrent memory reclamation into automatic reference counting. PLDI 2022: 61-75 - [c156]Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun:
PaC-trees: supporting parallel and compressed purely-functional collections. PLDI 2022: 108-121 - [c155]Naama Ben-David, Guy E. Blelloch:
Fast and Fair Randomized Wait-Free Locks. PODC 2022: 187-197 - [c154]Sam Westrick, Mike Rainey, Daniel Anderson, Guy E. Blelloch:
Parallel block-delayed sequences. PPoPP 2022: 61-75 - [c153]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Lock-free locks revisited. PPoPP 2022: 278-293 - [c152]Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank:
FliT: a library for simple and efficient persistent algorithms. PPoPP 2022: 309-321 - [c151]Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, Yihan Sun:
The problem-based benchmark suite (PBBS), V2. PPoPP 2022: 445-447 - [d1]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning (Artifact). Zenodo, 2022
- [i44]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Lock-Free Locks Revisited. CoRR abs/2201.00813 (2022) - [i43]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting. CoRR abs/2204.05985 (2022) - [i42]Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun:
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections. CoRR abs/2204.06077 (2022) - [i41]Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey, Phillip B. Gibbons:
PIM-tree: A Skew-resistant Index for Processing-in-Memory. CoRR abs/2211.10516 (2022) - [i40]Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert:
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR abs/2212.13557 (2022) - 2021
- [j46]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. ACM Trans. Parallel Comput. 8(1): 4:1-4:70 (2021) - [c150]Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Read-Only Semi-External Model. APOCS 2021: 70-84 - [c149]Guy E. Blelloch:
Is Asymptotic Cost Analysis Useful in Developing Practical Parallel Algorithms. IPDPS 2021: 681 - [c148]Daniel Anderson, Guy E. Blelloch, Yuanhao Wei:
Concurrent deferred reference counting with constant-time overhead. PLDI 2021: 526-541 - [c147]Yuanhao Wei, Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun:
Constant-time snapshots with applications to concurrent data structures. PPoPP 2021: 31-46 - [c146]Guy E. Blelloch, William J. Dally, Margaret Martonosi, Uzi Vishkin, Katherine A. Yelick:
SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures. SPAA 2021: 1-7 - [c145]Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar:
Efficient Parallel Self-Adjusting Computation. SPAA 2021: 59-70 - [c144]Daniel Anderson, Guy E. Blelloch:
Parallel Minimum Cuts in O(m log2n) Work and Low Depth. SPAA 2021: 71-82 - [c143]Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey:
The Processing-in-Memory Model. SPAA 2021: 295-306 - [c142]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. DISC 2021: 12:1-12:20 - [i39]Daniel Anderson, Guy E. Blelloch:
Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth. CoRR abs/2102.05301 (2021) - [i38]Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar:
Efficient Parallel Self-Adjusting Computation. CoRR abs/2105.06712 (2021) - [i37]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Space and Time Bounded Multiversion Garbage Collection. CoRR abs/2108.02775 (2021) - [i36]Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank:
FliT: A Library for Simple and Efficient Persistent Algorithms. CoRR abs/2108.04202 (2021) - [i35]Naama Ben-David, Guy E. Blelloch:
Fast and Fair Lock-Free Locks. CoRR abs/2108.04520 (2021) - [i34]Guy E. Blelloch, Magdalen Dobson:
The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model. CoRR abs/2110.11836 (2021) - [i33]Magdalen Dobson, Guy E. Blelloch:
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. CoRR abs/2111.04182 (2021) - 2020
- [j45]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. J. ACM 67(5): 27:1-27:27 (2020) - [j44]Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun:
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs. Proc. VLDB Endow. 13(9): 1598-1613 (2020) - [c141]Guy E. Blelloch, Yan Gu:
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. APOCS 2020: 105-119 - [c140]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Parallel Batch-Dynamic Trees via Change Propagation. ESA 2020: 2:1-2:23 - [c139]Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank:
NVTraverse: in NVRAM data structures, the destination is more important than the journey. PLDI 2020: 377-392 - [c138]Laxman Dhulipala, Jessica Shi, Tom Tseng, Guy E. Blelloch, Julian Shun:
The Graph Based Benchmark Suite (GBBS). GRADES-NDA@SIGMOD 2020: 11:1-11:8 - [c137]Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan:
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. SPAA 2020: 51-61 - [c136]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. SPAA 2020: 89-102 - [c135]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Randomized Incremental Convex Hull is Highly Parallel. SPAA 2020: 103-115 - [c134]Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala:
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. SPAA 2020: 507-509 - [c133]Guy E. Blelloch, Yuanhao Wei:
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. DISC 2020: 5:1-5:17 - [c132]Guy E. Blelloch, Yuanhao Wei:
Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. DISC 2020: 51:1-51:3 - [e9]Guy E. Blelloch, Irene Finocchi:
Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2020, Salt Lake City, UT, USA, January 5-6, 2020. SIAM 2020, ISBN 978-1-61197-600-7 [contents] - [i32]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick:
Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees. CoRR abs/2002.05129 (2020) - [i31]Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan:
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. CoRR abs/2002.05710 (2020) - [i30]Guy E. Blelloch, Yuanhao Wei:
Concurrent Reference Counting and Resource Management in Wait-free Constant Time. CoRR abs/2002.07053 (2020) - [i29]Michal Friedman, Naama Ben-David, Yuanhao Wei, Guy E. Blelloch, Erez Petrank:
NVTraverse: In NVRAM Data Structures, the Destination is More Important than the Journey. CoRR abs/2004.02841 (2020) - [i28]Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei:
Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures. CoRR abs/2007.02372 (2020) - [i27]Guy E. Blelloch, Yuanhao Wei:
Concurrent Fixed-Size Allocation and Free in Constant Time. CoRR abs/2008.04296 (2020)
2010 – 2019
- 2019
- [j43]Yihan Sun, Guy E. Blelloch, Wan Shen Lim, Andrew Pavlo:
On Supporting Efficient Snapshot Isolation for Hybrid Workloads with Multi-Versioned Indexes. Proc. VLDB Endow. 13(2): 211-225 (2019) - [c131]Naama Ben-David, Ziv Scully, Guy E. Blelloch:
Unfair Scheduling Patterns in NUMA Architectures. PACT 2019: 205-218 - [c130]Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. ALENEX 2019: 92-106 - [c129]Yihan Sun, Guy E. Blelloch:
Parallel Range, Segment and Rectangle Queries with Augmented Maps. ALENEX 2019: 159-173 - [c128]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Low-latency graph streaming using compressed purely-functional trees. PLDI 2019: 918-934 - [c127]Naama Ben-David, Guy E. Blelloch, Michal Friedman, Yuanhao Wei:
Making concurrent algorithms detectable: poster. PPoPP 2019: 419-420 - [c126]Yihan Sun, Guy E. Blelloch:
Implementing parallel and concurrent tree structures. PPoPP 2019: 447-450 - [c125]Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei:
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. SPAA 2019: 241-252 - [c124]Naama Ben-David, Guy E. Blelloch, Michal Friedman, Yuanhao Wei:
Delay-Free Concurrency on Faulty Persistent Memory. SPAA 2019: 253-264 - [c123]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala:
Parallel Batch-Dynamic Graph Connectivity. SPAA 2019: 381-392 - [i26]Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun:
Optimal Parallel Algorithms in the Binary-Forking Model. CoRR abs/1903.04650 (2019) - [i25]Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala:
Parallel Batch-Dynamic Graph Connectivity. CoRR abs/1903.08794 (2019) - [i24]Laxman Dhulipala, Julian Shun, Guy E. Blelloch:
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees. CoRR abs/1904.08380 (2019) - [i23]Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun:
Semi-Asymmetric Parallel Graph Algorithms for NVRAMs. CoRR abs/1910.12310 (2019) - [i22]Guy E. Blelloch, Yuanhao Wei:
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS. CoRR abs/1911.09671 (2019) - 2018
- [c122]Yan Gu, Yihan Sun, Guy E. Blelloch:
Algorithmic Building Blocks for Asymmetric Memories. ESA 2018: 44:1-44:15 - [c121]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. IPDPS 2018: 711-722 - [c120]Yihan Sun, Daniel Ferizovic, Guy E. Blelloch:
PAM: parallel augmented maps. PPoPP 2018: 290-304 - [c119]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. SPAA 2018: 235-246 - [c118]Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Parallel Persistent Memory Model. SPAA 2018: 247-258 - [c117]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. SPAA 2018: 393-404 - [i21]Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei:
Efficient Single Writer Concurrency. CoRR abs/1803.08617 (2018) - [i20]Yihan Sun, Guy E. Blelloch:
Parallel Range and Segment Queries with Augmented Maps. CoRR abs/1803.08621 (2018) - [i19]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. CoRR abs/1805.05208 (2018) - [i18]Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
The Parallel Persistent Memory Model. CoRR abs/1805.05580 (2018) - [i17]Guy E. Blelloch, Yan Gu, Yihan Sun, Julian Shun:
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. CoRR abs/1805.05592 (2018) - [i16]Naama Ben-David, Guy E. Blelloch, Yuanhao Wei:
Making Concurrent Algorithms Detectable. CoRR abs/1806.04780 (2018) - [i15]Yan Gu, Yihan Sun, Guy E. Blelloch:
Algorithmic Building Blocks for Asymmetric Memories. CoRR abs/1806.10370 (2018) - [i14]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. CoRR abs/1810.05303 (2018) - [i13]Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch:
Batch-Parallel Euler Tour Trees. CoRR abs/1810.10738 (2018) - 2017
- [j42]Guy E. Blelloch:
Technical Perspective: Functional compilers. Commun. ACM 60(5): 82 (2017) - [j41]Julian Labeit, Julian Shun, Guy E. Blelloch:
Parallel lightweight wavelet tree, suffix array and FM-index construction. J. Discrete Algorithms 43: 2-17 (2017) - [j40]Ziv Scully, Guy E. Blelloch, Mor Harchol-Balter, Alan Scheller-Wolf:
Optimally Scheduling Jobs with Multiple Tasks. SIGMETRICS Perform. Evaluation Rev. 45(2): 36-38 (2017) - [c116]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies. HiPC 2017: 124-133 - [c115]Guy E. Blelloch, Yan Gu, Yihan Sun:
Efficient Construction of Probabilistic Tree Embeddings. ICALP 2017: 26:1-26:14 - [c114]Guy E. Blelloch:
Some Sequential Algorithms are Almost Always Parallel. PODC 2017: 1 - [c113]Naama Ben-David, Guy E. Blelloch:
Analyzing Contention and Backoff in Asynchronous Shared Memory. PODC 2017: 53-62 - [c112]Ananya Kumar, Guy E. Blelloch, Robert Harper:
Parallel functional arrays. POPL 2017: 706-718 - [c111]Guy E. Blelloch:
Some Sequential Algorithms are Almost Always Parallel. SPAA 2017: 141 - [c110]Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. SPAA 2017: 293-304 - [i12]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Implicit Decomposition for Write-Efficient Connectivity Algorithms. CoRR abs/1710.02637 (2017) - 2016
- [j39]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental Analysis of Space-Bounded Schedulers. ACM Trans. Parallel Comput. 3(1): 8:1-8:27 (2016) - [c109]Julian Labeit, Julian Shun, Guy E. Blelloch:
Parallel Lightweight Wavelet Tree, Suffix Array and FM-Index Construction. DCC 2016: 33-42 - [c108]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms with Asymmetric Read and Write Costs. ESA 2016: 14:1-14:18 - [c107]Ram Raghunathan, Stefan K. Muller, Umut A. Acar, Guy E. Blelloch:
Hierarchical memory management for parallel programs. ICFP 2016: 392-406 - [c106]Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun:
Parallel Algorithms for Asymmetric Read-Write Costs. SPAA 2016: 145-156 - [c105]Guy E. Blelloch, Daniel Ferizovic, Yihan Sun:
Just Join for Parallel Ordered Sets. SPAA 2016: 253-264 - [c104]Guy E. Blelloch, Yan Gu, Yihan Sun, Kanat Tangwongsan:
Parallel Shortest Paths Using Radius Stepping. SPAA 2016: 443-454 - [c103]Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun:
Parallelism in Randomized Incremental Algorithms. SPAA 2016: 467-478 - [i11]Guy E. Blelloch, Daniel Ferizovic, Yihan Sun:
Parallel Ordered Sets Using Join. CoRR abs/1602.02120 (2016) - [i10]Guy E. Blelloch, Yan Gu, Yihan Sun, Kanat Tangwongsan:
Parallel Shortest-Paths Using Radius Stepping. CoRR abs/1602.03881 (2016) - [i9]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. CoRR abs/1603.03505 (2016) - [i8]Guy E. Blelloch, Yan Gu, Yihan Sun:
A New Efficient Construction on Probabilistic Tree Embeddings. CoRR abs/1605.04651 (2016) - [i7]Yihan Sun, Daniel Ferizovic, Guy E. Blelloch:
PAM: Parallel Augmented Maps. CoRR abs/1612.05665 (2016) - 2015
- [j38]Guy E. Blelloch, Robert Harper:
Cache efficient functional algorithms. Commun. ACM 58(7): 101-108 (2015) - [j37]Yan Gu, Yong He, Guy E. Blelloch:
Ray Specialized Contraction on Bounding Volume Hierarchies. Comput. Graph. Forum 34(7): 309-318 (2015) - [c102]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+. DCC 2015: 403-412 - [c101]Niklas Baumstark, Guy E. Blelloch, Julian Shun:
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. ESA 2015: 106-117 - [c100]Umut A. Acar, Guy E. Blelloch, Matthew Fluet, Stefan K. Muller, Ram Raghunathan:
Coupling Memory and Computation for Locality Management. SNAPL 2015: 1-14 - [c99]Julian Shun, Yan Gu, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel. SODA 2015: 431-448 - [c98]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Sorting with Asymmetric Read and Write Costs. SPAA 2015: 1-12 - [c97]Yan Gu, Julian Shun, Yihan Sun, Guy E. Blelloch:
A Top-Down Parallel Semisort. SPAA 2015: 24-34 - [e8]Guy E. Blelloch, Kunal Agrawal:
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, SPAA 2015, Portland, OR, USA, June 13-15, 2015. ACM 2015, ISBN 978-1-4503-3588-1 [contents] - [i6]Niklas Baumstark, Guy E. Blelloch, Julian Shun:
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm. CoRR abs/1507.01926 (2015) - [i5]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Yan Gu, Julian Shun:
Efficient Algorithms under Asymmetric Read and Write Costs. CoRR abs/1511.01038 (2015) - 2014
- [j36]Guy E. Blelloch, Anupam Gupta, Ioannis Koutis, Gary L. Miller, Richard Peng, Kanat Tangwongsan:
Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs. Theory Comput. Syst. 55(3): 521-554 (2014) - [j35]Julian Shun, Guy E. Blelloch:
A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction. ACM Trans. Parallel Comput. 1(1): 8:1-8:20 (2014) - [c96]Harsha Vardhan Simhadri, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Aapo Kyrola:
Experimental analysis of space-bounded schedulers. SPAA 2014: 30-41 - [c95]Julian Shun, Guy E. Blelloch:
Phase-concurrent hash tables for determinism. SPAA 2014: 96-107 - [c94]Julian Shun, Laxman Dhulipala, Guy E. Blelloch:
A simple and practical linear-work parallel algorithm for connectivity. SPAA 2014: 143-153 - [c93]Aapo Kyrola, Julian Shun, Guy E. Blelloch:
Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest. SEA 2014: 123-137 - [e7]Guy E. Blelloch, Peter Sanders:
26th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '14, Prague, Czech Republic - June 23 - 25, 2014. ACM 2014, ISBN 978-1-4503-2821-0 [contents] - 2013
- [j34]Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data. IEEE ACM Trans. Comput. Biol. Bioinform. 10(5): 1137-1149 (2013) - [c92]Yan Gu, Yong He, Kayvon Fatahalian, Guy E. Blelloch:
Efficient BVH Construction via Approximate Agglomerative Clustering. High Performance Graphics 2013: 81-88 - [c91]Giuseppe F. Italiano, Henning Meyerhenke, Guy E. Blelloch, Philippas Tsigas:
Topic 12: Theory and Algorithms for Parallel Computation - (Introduction). Euro-Par 2013: 645-646 - [c90]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Program-centric cost models for locality. MSPC@PLDI 2013: 6:1-6:2 - [c89]Guy E. Blelloch, Robert Harper:
Cache and I/O efficent functional algorithms. POPL 2013: 39-50 - [c88]Julian Shun, Guy E. Blelloch:
Ligra: a lightweight graph processing framework for shared memory. PPoPP 2013: 135-146 - [c87]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. PPoPP 2013: 299-300 - [c86]Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons:
Reducing contention through priority updates. SPAA 2013: 152-163 - [e6]Guy E. Blelloch, Berthold Vöcking:
25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA '13, Montreal, QC, Canada - July 23 - 25, 2013. ACM 2013, ISBN 978-1-4503-1572-2 [contents] - 2012
- [j33]Guy E. Blelloch, Dan Halperin:
Introduction to special issue ALENEX'10. ACM J. Exp. Algorithmics 17(1) (2012) - [c85]Guy E. Blelloch:
Problem Based Benchmarks. ANALCO 2012 - [c84]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 - [c83]Ruy Ley-Wild, Umut A. Acar, Guy E. Blelloch:
Non-monotonic Self-Adjusting Computation. ESOP 2012: 476-496 - [c82]Aapo Kyrola, Guy E. Blelloch, Carlos Guestrin:
GraphChi: Large-Scale Graph Computation on Just a PC. OSDI 2012: 31-46 - [c81]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Julian Shun:
Internally deterministic parallel algorithms can be fast. PPoPP 2012: 181-192 - [c80]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 - [c79]Guy E. Blelloch, Harsha Vardhan Simhadri, Kanat Tangwongsan:
Parallel and I/O efficient set covering algorithms. SPAA 2012: 82-90 - [c78]Guy E. Blelloch, Anupam Gupta, Kanat Tangwongsan:
Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design. SPAA 2012: 205-213 - [c77]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy sequential maximal independent set and matching are parallel on average. SPAA 2012: 308-317 - [e5]Guy E. Blelloch, Maurice Herlihy:
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 [contents] - [i4]Guy E. Blelloch, Jeremy T. Fineman, Julian Shun:
Greedy Sequential Maximal Independent Set and Matching are Parallel on Average. CoRR abs/1202.3205 (2012) - 2011
- [j32]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny. J. Comput. Biol. 18(3): 445-457 (2011) - [j31]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz:
An Optimization-Based Sampling Scheme for Phylogenetic Trees. J. Comput. Biol. 18(11): 1599-1609 (2011) - [j30]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. Biol. Bioinform. 8(4): 918-928 (2011) - [c76]Guy E. Blelloch, Julian Shun:
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction. ALENEX 2011: 48-58 - [c75]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz:
An Optimization-Based Sampling Scheme for Phylogenetic Trees. RECOMB 2011: 252-266 - [c74]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 - [c73]Guy E. Blelloch, Richard Peng, Kanat Tangwongsan:
Linear-work greedy parallel approximate set cover and variants. SPAA 2011: 23-32 - [c72]Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Scheduling irregular parallel computations on hierarchical caches. SPAA 2011: 355-366 - [r2]Guy E. Blelloch:
NESL. Encyclopedia of Parallel Computing 2011: 1278-1283 - [i3]Umut A. Acar, Guy E. Blelloch, Robert Harper:
Selective Memoization. CoRR abs/1106.0447 (2011) - [i2]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) - 2010
- [j29]Daniel Spoonhower, Guy E. Blelloch, Robert Harper, Phillip B. Gibbons:
Space profiling for parallel functional programs. J. Funct. Program. 20(5-6): 417-461 (2010) - [c71]Guy E. Blelloch, Arash Farzan:
Succinct Representations of Separable Graphs. CPM 2010: 138-150 - [c70]Guy E. Blelloch:
Functional parallel algorithms. ICFP 2010: 247-248 - [c69]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 - [c68]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 - [c67]Navodit Misra, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-state Phylogeny. RECOMB 2010: 369-383 - [c66]Guy E. Blelloch, Ioannis Koutis, Gary L. Miller, Kanat Tangwongsan:
Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid. SC 2010: 1-12 - [c65]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Low depth cache-oblivious algorithms. SPAA 2010: 189-199 - [c64]Guy E. Blelloch, Kanat Tangwongsan:
Parallel approximation algorithms for facility-location problems. SPAA 2010: 315-324 - [e4]Guy E. Blelloch, Dan Halperin:
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 [contents] - [i1]Guy E. Blelloch, Kanat Tangwongsan:
Parallel Approximation Algorithms for Facility-Location Problems. CoRR abs/1006.1923 (2010)
2000 – 2009
- 2009
- [j28]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): 3:1-3:53 (2009) - [c63]Guy E. Blelloch:
Parallel thinking. PPoPP 2009: 1-2 - [c62]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 - [c61]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Brief announcement: low depth cache-oblivious sorting. SPAA 2009: 121-123 - 2008
- [j27]Daniel K. Blandford, Guy E. Blelloch:
Compact dictionaries for variable-length keys and data with applications. ACM Trans. Algorithms 4(2): 17:1-17:25 (2008) - [j26]Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 323-331 (2008) - [c60]Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Duru Türkoglu:
Robust Kinetic Convex Hulls in 3D. ESA 2008: 29-40 - [c59]Guy E. Blelloch, Virginia Vassilevska, Ryan Williams:
A New Combinatorial Approach for Sparse Graph Problems. ICALP (1) 2008: 108-120 - [c58]Daniel Spoonhower, Guy E. Blelloch, Robert Harper, Phillip B. Gibbons:
Space profiling for parallel functional programs. ICFP 2008: 253-264 - [c57]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 - [c56]Guy E. Blelloch:
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting. SODA 2008: 894-903 - [c55]Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri:
Combinable memory-block transactions. SPAA 2008: 23-34 - [c54]Guy E. Blelloch, Daniel Golovin, Virginia Vassilevska:
Uniquely Represented Data Structures for Computational Geometry. SWAT 2008: 17-28 - 2007
- [j25]Srinath Sridhar, Fumei Lam, Guy E. Blelloch, R. Ravi, Russell Schwartz:
Direct maximum parsimony phylogeny reconstruction from genotype data. BMC Bioinform. 8 (2007) - [j24]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. Biol. Bioinform. 4(4): 561-571 (2007) - [c53]Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan:
Kinetic 3D convex hulls via self-adjusting computation. SCG 2007: 129-130 - [c52]Guy E. Blelloch, Daniel Golovin:
Strongly History-Independent Hashing with Applications. FOCS 2007: 272-282 - [c51]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 - [c50]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 - [e3]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, ISBN 978-1-59593-690-5 [contents] - 2006
- [j23]Umut A. Acar, Guy E. Blelloch, Robert Harper:
Adaptive functional programming. ACM Trans. Program. Lang. Syst. 28(6): 990-1034 (2006) - [c49]Daniel K. Blandford, Guy E. Blelloch, Clemens Kadow:
Engineering a compact parallel delaunay algorithm in 3D. SCG 2006: 292-300 - [c48]Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, Jorge L. Vittes:
Kinetic Algorithms Via Self-adjusting Computation. ESA 2006: 636-647 - [c47]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 - [c46]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 - [c45]Umut A. Acar, Guy E. Blelloch, Matthias Blume, Kanat Tangwongsan:
An experimental analysis of self-adjusting computation. PLDI 2006: 96-107 - [c44]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 - 2005
- [j22]Daniel K. Blandford, Guy E. Blelloch, David E. Cardoze, Clemens Kadow:
Compact representations of simplicial meshes in two and three dimensions. Int. J. Comput. Geom. Appl. 15(1): 3-24 (2005) - [c43]Umut A. Acar, Guy E. Blelloch, Jorge L. Vittes:
An Experimental Analysis of Change Propagation in Dynamic Trees. ALENEX/ANALCO 2005: 41-54 - [c42]Daniel K. Blandford, Guy E. Blelloch:
Dictionaries using variable-length keys and data, with applications. SODA 2005: 1-10 - [c41]Daniel Spoonhower, Guy E. Blelloch, Robert Harper:
Using page residency to balance tradeoffs in tracing garbage collection. VEE 2005: 57-67 - [c40]Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper, Kanat Tangwongsan:
A Library for Self-Adjusting Computation. ML 2005: 127-154 - 2004
- [c39]Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash:
An Experimental Analysis of a Compact Graph Representation. ALENEX/ANALC 2004: 49-61 - [c38]Daniel K. Blandford, Guy E. Blelloch:
Compact representations of ordered sets. SODA 2004: 11-19 - [c37]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 - [c36]Guy E. Blelloch, Phillip B. Gibbons:
Effectively sharing a cache among threads. SPAA 2004: 235-244 - 2003
- [j21]Aleksandar Nanevski, Guy E. Blelloch, Robert Harper:
Automatic Generation of Staged Geometric Predicates. High. Order Symb. Comput. 16(4): 379-400 (2003) - [j20]Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons:
Scalable Room Synchronizations. Theory Comput. Syst. 36(5): 397-430 (2003) - [c35]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 - [c34]Umut A. Acar, Guy E. Blelloch, Robert Harper:
Selective memoization. POPL 2003: 14-25 - [c33]Guy E. Blelloch, Bruce M. Maggs, Shan Leung Maverick Woo:
Space-efficient finger search on degree-balanced search trees. SODA 2003: 374-383 - [c32]Daniel K. Blandford, Guy E. Blelloch, Ian A. Kash:
Compact representations of separable graphs. SODA 2003: 679-688 - 2002
- [j19]Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe:
The Data Locality of Work Stealing. Theory Comput. Syst. 35(3): 321-347 (2002) - [c31]Daniel K. Blandford, Guy E. Blelloch:
Index Compression through Document Reordering. DCC 2002: 342-351 - [c30]Umut A. Acar, Guy E. Blelloch, Robert Harper:
Adaptive functional programming. POPL 2002: 247-259 - 2001
- [j18]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) - [c29]Aleksandar Nanevski, Guy E. Blelloch, Robert Harper:
Automatic Generation of Staged Geometric Predicates. ICFP 2001: 217-228 - [c28]Perry Cheng, Guy E. Blelloch:
A Parallel, Real-Time Garbage Collector. PLDI 2001: 125-136 - [c27]Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons:
Room synchronizations. SPAA 2001: 122-133 - 2000
- [c26]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 - [c25]Umut A. Acar, Guy E. Blelloch, Robert D. Blumofe:
The data locality of work stealing. SPAA 2000: 1-12
1990 – 1999
- 1999
- [j17]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) - [j16]Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias:
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. J. ACM 46(2): 281-321 (1999) - [j15]Guy E. Blelloch, Margaret Reid-Miller:
Pipelining with Futures. Theory Comput. Syst. 32(3): 213-239 (1999) - [j14]Girija J. Narlikar, Guy E. Blelloch:
Space-Efficient Scheduling of Nested Parallelism. ACM Trans. Program. Lang. Syst. 21(1): 138-173 (1999) - [j13]John Greiner, Guy E. Blelloch:
A Provably Time-Efficient Parallel Implementation of Full Speculation. ACM Trans. Program. Lang. Syst. 21(2): 240-285 (1999) - [c24]Guy E. Blelloch, Perry Cheng:
On Bounding Time and Space for Multiprocessor Garbage Collection. PLDI 1999: 104-117 - [c23]Guy E. Blelloch, Perry Cheng:
On bounding time and space for multiprocessor garbage collection (with retrospective). Best of PLDI 1999: 626-641 - [p1]Guy E. Blelloch, Bruce M. Maggs:
Parallel Algorithms. Algorithms and Theory of Computation Handbook 1999 - 1998
- [j12]Guy E. Blelloch, Charles E. Leiserson:
An Experimental Analysis of Parallel Sorting Algorithms. Theory Comput. Syst. 31(2): 135-167 (1998) - [c22]Girija J. Narlikar, Guy E. Blelloch:
Pthreads for Dynamic and Irregular Parallelism. SC 1998: 31 - [c21]Guy E. Blelloch, Margaret Reid-Miller:
Fast Set Operations Using Treaps. SPAA 1998: 16-26 - 1997
- [j11]Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias, Marco Zagha:
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors. IEEE Trans. Parallel Distributed Syst. 8(9): 943-958 (1997) - [c20]Girija J. Narlikar, Guy E. Blelloch:
Space-Efficient Implementation of Nested Parallelism. PPoPP 1997: 25-36 - [c19]Guy E. Blelloch, Phillip B. Gibbons, Girija J. Narlikar, Yossi Matias:
Space-Efficient Scheduling of Parallelism with Synchronization Variables. SPAA 1997: 12-23 - [c18]Guy E. Blelloch, Margaret Reid-Miller:
Pipelining with Futures. SPAA 1997: 249-259 - [r1]Guy E. Blelloch, Bruce M. Maggs:
Parallel Algorithms. The Computer Science and Engineering Handbook 1997: 277-315 - 1996
- [j10]Guy E. Blelloch:
Programming Parallel Algorithms. Commun. ACM 39(3): 85-97 (1996) - [j9]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) - [j8]Guy E. Blelloch, Bruce M. Maggs:
Parallel Algorithms. ACM Comput. Surv. 28(1): 51-54 (1996) - [c17]Guy E. Blelloch, Gary L. Miller, Dafna Talmor:
Developing a Practical Projection-Based Parallel Delaunay Algorithm. SCG 1996: 186-195 - [c16]Guy E. Blelloch, John Greiner:
A Provable Time and Space Efficient Implementation of NESL. ICFP 1996: 213-225 - [c15]John Greiner, Guy E. Blelloch:
A Provably Time-Efficient Parallel Implementation of Full Speculation. POPL 1996: 309-321 - [e2]Guy E. Blelloch:
Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA '96, Padua, Italy, June 24-26, 1996. ACM 1996, ISBN 0-89791-809-6 [contents] - 1995
- [j7]Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha:
Solving Linear Recurrences with Loop Raking. J. Parallel Distributed Comput. 25(1): 91-97 (1995) - [c14]Guy E. Blelloch, John Greiner:
Parallelism in Sequential Functional Languages. FPCA 1995: 226-237 - [c13]Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias:
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism. SPAA 1995: 1-12 - [c12]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 - 1994
- [j6]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) - [j5]Guy E. Blelloch, Jonathan C. Hardwick, Jay Sipelstein, Marco Zagha, Siddhartha Chatterjee:
Implementation of a Portable Nested Data-Parallel Language. J. Parallel Distributed Comput. 21(1): 4-14 (1994) - [c11]Guy E. Blelloch, Girija J. Narlikar:
A practical comparison of N-body algorithms. Parallel Algorithms 1994: 81-96 - [e1]Guy E. Blelloch, K. Mani Chandy, Suresh Jagannathan:
Specification of Parallel Algorithms, Proceedings of a DIMACS Workshop, Princeton, New Jersey, USA, May 9-11, 1994. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 18, DIMACS/AMS 1994, ISBN 978-0-8218-0253-3 [contents] - 1993
- [c10]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
- [c9]Guy E. Blelloch, Siddhartha Chatterjee, Marco Zagha:
Solving Linear Recurrences with Loop Raking. IPPS 1992: 416-424 - 1991
- [j4]Jay Sipelstein, Guy E. Blelloch:
Collection-oriented languages. Proc. IEEE 79(4): 504-523 (1991) - [c8]Siddhartha Chatterjee, Guy E. Blelloch, Allan L. Fisher:
Size and Access Inference for Data-Parallel Programs. PLDI 1991: 130-144 - [c7]Marco Zagha, Guy E. Blelloch:
Radix sort for vector multiprocessors. SC 1991: 712-721 - [c6]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
- [b1]Guy E. Blelloch:
Vector Models for Data-Parallel Computing. MIT Press 1990, ISBN 0-262-02313-X - [j3]Guy E. Blelloch, Gary Sabot:
Compiling Collection-Oriented Languages onto Massively Parallel Computers. J. Parallel Distributed Comput. 8(2): 119-134 (1990) - [c5]Siddhartha Chatterjee, Guy E. Blelloch, Marco Zagha:
Scan primitives for vector computers. SC 1990: 666-675
1980 – 1989
- 1989
- [j2]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) - [j1]Guy E. Blelloch:
Scans as Primitive Parallel Operations. IEEE Trans. Computers 38(11): 1526-1538 (1989) - [c4]Ajit Agrawal, Guy E. Blelloch, Robert L. Krawitz, C. A. Phillips:
Four Vector-Matrix Primitives. SPAA 1989: 292-302 - 1987
- [c3]Guy E. Blelloch:
Scans as Primitive Parallel Operations. ICPP 1987: 355-362 - [c2]Guy E. Blelloch, Charles R. Rosenberg:
Network Learning on the Connection Machine. IJCAI 1987: 323-326 - 1986
- [c1]Guy E. Blelloch:
CIS: A Massively Concurrent Rule-Based System. AAAI 1986: 735-741
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-31 20:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
