Guy E. Blelloch

From MaRDI portal
Person:487263

Available identifiers

zbMath Open blelloch.guy-eMaRDI QIDQ487263

List of research outcomes





PublicationDate of PublicationType
The geometry of tree-based sorting2024-11-14Paper
Parallel nearest neighbors in low dimensions with batch updates2024-05-24Paper
Fast and Fair Randomized Wait-Free Locks2024-03-26Paper
https://portal.mardi4nfdi.de/entity/Q60616942023-12-08Paper
Ll/SC and atomic copy: constant time, space efficient implementations using only pointer-width CAS2023-11-02Paper
Parallelism in Randomized Incremental Algorithms2022-03-31Paper
Algorithmic Building Blocks for Asymmetric Memories2021-08-04Paper
https://portal.mardi4nfdi.de/entity/Q51113562020-05-27Paper
Batch-Parallel Euler Tour Trees2019-09-13Paper
Parallel Range, Segment and Rectangle Queries with Augmented Maps2019-09-13Paper
A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction2019-09-12Paper
Compact dictionaries for variable-length keys and data with applications2018-11-05Paper
Efficient Algorithms with Asymmetric Read and Write Costs2018-03-02Paper
Parallel functional arrays2017-10-20Paper
Analyzing Contention and Backoff in Asynchronous Shared Memory2017-10-11Paper
Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel2017-10-05Paper
Parallel lightweight wavelet tree, suffix array and FM-index construction2017-05-29Paper
Hierarchical memory management for parallel programs2017-05-10Paper
A provable time and space efficient implementation of NESL2016-09-01Paper
Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm2015-11-19Paper
https://portal.mardi4nfdi.de/entity/Q55013042015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55012372015-08-03Paper
Adaptive functional programming2015-03-17Paper
Space profiling for parallel functional programs2015-03-16Paper
Automatic generation of staged geometric predicates2015-03-09Paper
Nearly-linear work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs2015-01-19Paper
Cache and I/O efficent functional algorithms2014-11-27Paper
Dictionaries using variable-length keys and data, with applications2014-10-13Paper
Non-monotonic Self-Adjusting Computation2012-06-22Paper
Space profiling for parallel functional programs2011-07-25Paper
https://portal.mardi4nfdi.de/entity/Q35794142010-08-06Paper
https://portal.mardi4nfdi.de/entity/Q35794042010-08-06Paper
Succinct Representations of Separable Graphs2010-07-26Paper
Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction2009-03-12Paper
https://portal.mardi4nfdi.de/entity/Q36015522009-02-10Paper
Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees2008-12-09Paper
Robust Kinetic Convex Hulls in 3D2008-11-25Paper
A New Combinatorial Approach for Sparse Graph Problems2008-08-28Paper
Uniquely Represented Data Structures for Computational Geometry2008-07-15Paper
Kinetic Algorithms Via Self-adjusting Computation2008-03-11Paper
COMPACT REPRESENTATIONS OF SIMPLICIAL MESHES IN TWO AND THREE DIMENSIONS2005-05-03Paper
Provably efficient scheduling for languages with fine-grained parallelism2005-01-25Paper
Scalable room synchronizations2004-09-22Paper
https://portal.mardi4nfdi.de/entity/Q44713582004-07-28Paper
https://portal.mardi4nfdi.de/entity/Q44713202004-07-28Paper
Automatic generation of staged geometric predicates2004-03-15Paper
The data locality of work stealing2002-12-01Paper
Persistent triangulations2001-11-21Paper
Design and implementation of a practical parallel Delaunay algorithm2000-07-17Paper
Pipelining with futures2000-01-25Paper
https://portal.mardi4nfdi.de/entity/Q43528321997-09-04Paper
Parallel solutions to geometric problems in the scan model of computation1994-12-11Paper

Research outcomes over time

This page was built for person: Guy E. Blelloch