Guy E. Blelloch

ORCID

Publication Activity (10 Years)

Years Active: 1986-2024
Publications (10 Years): 125

Top Venues

CoRR

SPAA

PPoPP

ACM Trans. Parallel Comput.

Publications

Guy E. Blelloch, Yuanhao Wei
VERLIB: Concurrent Versioned Pointers. PPoPP (2024)
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)
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)
Guy E. Blelloch, Magdalen Dobson
The Geometry of Tree-Based Sorting. ICALP (2023)
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 (2023)
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
Smarter Atomic Smart Pointers: Safe and Efficient Concurrent Memory Management (Abstract). HOPC@SPAA (2023)
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
Practically and Theoretically Efficient Garbage Collection for Multiversioning. PPoPP (2023)
Guy E. Blelloch
Are Parallel Algorithms Ready for Prime Time? SPAA (2023)
Daniel Anderson, Guy E. Blelloch
) Work and Low Depth. ACM Trans. Parallel Comput. 10 (4) (2023)
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)
Daniel Anderson, Guy E. Blelloch
Deterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span. CoRR (2023)
Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun
PaC-trees: supporting parallel and compressed purely-functional collections. PLDI (2022)
Guy E. Blelloch, Magdalen Dobson
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. ALENEX (2022)
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
Turning manual concurrent memory reclamation into automatic reference counting. PLDI (2022)
Naama Ben-David, Guy E. Blelloch, Yuanhao Wei
Lock-Free Locks Revisited. CoRR (2022)
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) (2022)
Laxman Dhulipala, Guy E. Blelloch, Yan Gu, Yihan Sun
PaC-trees: Supporting Parallel and Compressed Purely-Functional Collections. CoRR (2022)
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
Turning Manual Concurrent Memory Reclamation into Automatic Reference Counting. CoRR (2022)
Naama Ben-David, Guy E. Blelloch, Yuanhao Wei
Lock-free locks revisited. PPoPP (2022)
Guy E. Blelloch, Daniel Ferizovic, Yihan Sun
Joinable Parallel Balanced Binary Trees. ACM Trans. Parallel Comput. 9 (2) (2022)
Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank
FliT: a library for simple and efficient persistent algorithms. PPoPP (2022)
Naama Ben-David, Guy E. Blelloch
Fast and Fair Randomized Wait-Free Locks. PODC (2022)
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 (2022)
Sam Westrick, Mike Rainey, Daniel Anderson, Guy E. Blelloch
Parallel block-delayed sequences. PPoPP (2022)
Yuanhao Wei, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert
Practically and Theoretically Efficient Garbage Collection for Multiversioning. CoRR (2022)
Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Magdalen Dobson, Yihan Sun
The problem-based benchmark suite (PBBS), V2. PPoPP (2022)
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)
Guy E. Blelloch
Is Asymptotic Cost Analysis Useful in Developing Practical Parallel Algorithms. IPDPS (2021)
Daniel Anderson, Guy E. Blelloch
(n)) Work and Low Depth. CoRR (2021)
Guy E. Blelloch, Laxman Dhulipala, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun
The Read-Only Semi-External Model. APOCS (2021)
Yuanhao Wei, Naama Ben-David, Michal Friedman, Guy E. Blelloch, Erez Petrank
FliT: A Library for Simple and Efficient Persistent Algorithms. CoRR (2021)
Guy E. Blelloch, Magdalen Dobson
The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model. CoRR (2021)
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. ACM Trans. Parallel Comput. 8 (1) (2021)
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar
Efficient Parallel Self-Adjusting Computation. CoRR (2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Space and Time Bounded Multiversion Garbage Collection. CoRR (2021)
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)
Daniel Anderson, Guy E. Blelloch
) Work and Low Depth. SPAA (2021)
Naama Ben-David, Guy E. Blelloch
Fast and Fair Lock-Free Locks. CoRR (2021)
Daniel Anderson, Guy E. Blelloch, Yuanhao Wei
Concurrent deferred reference counting with constant-time overhead. PLDI (2021)
Daniel Anderson, Guy E. Blelloch, Anubhav Baweja, Umut A. Acar
Efficient Parallel Self-Adjusting Computation. SPAA (2021)
Naama Ben-David, Guy E. Blelloch, Panagiota Fatourou, Eric Ruppert, Yihan Sun, Yuanhao Wei
Space and Time Bounded Multiversion Garbage Collection. DISC (2021)
Hongbo Kang, Phillip B. Gibbons, Guy E. Blelloch, Laxman Dhulipala, Yan Gu, Charles McGuffey
The Processing-in-Memory Model. SPAA (2021)
Magdalen Dobson, Guy E. Blelloch
Parallel Nearest Neighbors in Low Dimensions with Batch Updates. CoRR (2021)
Laxman Dhulipala, Jessica Shi, Tom Tseng, Guy E. Blelloch, Julian Shun
The Graph Based Benchmark Suite (GBBS). GRADES-NDA@SIGMOD (2020)
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala, Sam Westrick
Parallel Batch-Dynamic Trees via Change Propagation. ESA (2020)
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) (2020)
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)
Guy E. Blelloch, Yuanhao Wei
Concurrent Reference Counting and Resource Management in Wait-free Constant Time. CoRR (2020)
Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun
Parallelism in Randomized Incremental Algorithms. J. ACM 67 (5) (2020)
Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan
Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model. SPAA (2020)
Daniel Anderson, Guy E. Blelloch, Kanat Tangwongsan
Work-efficient Batch-incremental Minimum Spanning Trees with Applications to the Sliding Window Model. CoRR (2020)
Guy E. Blelloch, Yuanhao Wei
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS. DISC (2020)
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 (2020)
Guy E. Blelloch, Yuanhao Wei
Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time. DISC (2020)
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 (2020)
Guy E. Blelloch, Yan Gu
Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract]. APOCS (2020)
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 (2020)
Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun
Randomized Incremental Convex Hull is Highly Parallel. SPAA (2020)
Guy E. Blelloch, Yuanhao Wei
Concurrent Fixed-Size Allocation and Free in Constant Time. CoRR (2020)
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun
Optimal Parallel Algorithms in the Binary-Forking Model. SPAA (2020)
Guy E. Blelloch, Daniel Anderson, Laxman Dhulipala
ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines. SPAA (2020)
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) (2019)
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, Yan Gu, Guy E. Blelloch, Phillip B. Gibbons, Julian Shun
Semi-Asymmetric Parallel Graph Algorithms for NVRAMs. CoRR (2019)
Yihan Sun, Guy E. Blelloch
Parallel Range, Segment and Rectangle Queries with Augmented Maps. ALENEX (2019)
Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei
Multiversion Concurrency with Bounded Delay and Precise Garbage Collection. SPAA (2019)
Guy E. Blelloch, Jeremy T. Fineman, Yan Gu, Yihan Sun
Optimal Parallel Algorithms in the Binary-Forking Model. CoRR (2019)
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala
Parallel Batch-Dynamic Graph Connectivity. CoRR (2019)
Naama Ben-David, Ziv Scully, Guy E. Blelloch
Unfair Scheduling Patterns in NUMA Architectures. PACT (2019)
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
Low-latency graph streaming using compressed purely-functional trees. PLDI (2019)
Guy E. Blelloch, Yuanhao Wei
LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations using only pointer-width CAS. CoRR (2019)
Umut A. Acar, Daniel Anderson, Guy E. Blelloch, Laxman Dhulipala
Parallel Batch-Dynamic Graph Connectivity. SPAA (2019)
Naama Ben-David, Guy E. Blelloch, Michal Friedman, Yuanhao Wei
Delay-Free Concurrency on Faulty Persistent Memory. SPAA (2019)
Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch
Batch-Parallel Euler Tour Trees. ALENEX (2019)
Naama Ben-David, Guy E. Blelloch, Michal Friedman, Yuanhao Wei
Making concurrent algorithms detectable: poster. PPoPP (2019)
Laxman Dhulipala, Julian Shun, Guy E. Blelloch
Low-Latency Graph Streaming Using Compressed Purely-Functional Trees. CoRR (2019)
Yihan Sun, Guy E. Blelloch
Implementing parallel and concurrent tree structures. PPoPP (2019)
Naama Ben-David, Guy E. Blelloch, Yihan Sun, Yuanhao Wei
Efficient Single Writer Concurrency. CoRR (2018)
Guy E. Blelloch, Yan Gu, Yihan Sun, Julian Shun
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. CoRR (2018)
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. SPAA (2018)
Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun
Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry. SPAA (2018)
Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun
The Parallel Persistent Memory Model. CoRR (2018)
Yihan Sun, Guy E. Blelloch
Parallel Range and Segment Queries with Augmented Maps. CoRR (2018)
Guy E. Blelloch, Phillip B. Gibbons, Yan Gu, Charles McGuffey, Julian Shun
The Parallel Persistent Memory Model. SPAA (2018)
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)
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. CoRR (2018)
Guy E. Blelloch, Yan Gu, Julian Shun, Yihan Sun
Parallelism in Randomized Incremental Algorithms. CoRR (2018)
Thomas Tseng, Laxman Dhulipala, Guy E. Blelloch
Batch-Parallel Euler Tour Trees. CoRR (2018)
Yan Gu, Yihan Sun, Guy E. Blelloch
Algorithmic Building Blocks for Asymmetric Memories. CoRR (2018)
Yan Gu, Yihan Sun, Guy E. Blelloch
Algorithmic Building Blocks for Asymmetric Memories. ESA (2018)
Yihan Sun, Daniel Ferizovic, Guy E. Blelloch
PAM: parallel augmented maps. PPOPP (2018)
Naama Ben-David, Guy E. Blelloch, Yuanhao Wei
Making Concurrent Algorithms Detectable. CoRR (2018)
Guy E. Blelloch
Technical Perspective: Functional compilers. Commun. ACM 60 (5) (2017)
Julian Labeit, Julian Shun, Guy E. Blelloch
Parallel lightweight wavelet tree, suffix array and FM-index construction. J. Discrete Algorithms 43 (2017)
Guy E. Blelloch, Yan Gu, Yihan Sun
Efficient Construction of Probabilistic Tree Embeddings. ICALP (2017)
Guy E. Blelloch, Phillip B. Gibbons, Harsha Vardhan Simhadri
Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies. HiPC (2017)
Laxman Dhulipala, Guy E. Blelloch, Julian Shun
Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing. SPAA (2017)
Guy E. Blelloch
Some Sequential Algorithms are Almost Always Parallel. PODC (2017)
Ziv Scully, Guy E. Blelloch, Mor Harchol-Balter, Alan Scheller-Wolf
Optimally Scheduling Jobs with Multiple Tasks. SIGMETRICS Perform. Evaluation Rev. 45 (2) (2017)
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 (2017)
Guy E. Blelloch
Some Sequential Algorithms are Almost Always Parallel. SPAA (2017)

Guy E. Blelloch.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Guy E. Blelloch