Guy E. Blelloch

Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Parallel Nearest Neighbors in Low Dimensions with Batch Updates.

[BibT_eX]

[DOI]

Magdalen Dobson

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2022

2021

Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2021

The Log-Interleave Bound: Towards the Unification of Sorting and the BST Model.

[BibT_eX]

[DOI]

Magdalen Dobson

CoRR, 2021

Fast and Fair Lock-Free Locks.

[BibT_eX]

[DOI]

CoRR, 2021

Parallel Minimum Cuts in O(m log2(n)) Work and Low Depth.

[BibT_eX]

[DOI]

CoRR, 2021

Space and Time Bounded Multiversion Garbage Collection.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Distributed Computing, 2021

The Processing-in-Memory Model.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

SPAA'21 Panel Paper: Architecture-Friendly Algorithms versus Algorithm-Friendly Architectures.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Efficient Parallel Self-Adjusting Computation.

[BibT_eX]

[DOI]

Proceedings of the SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 2021

Constant-time snapshots with applications to concurrent data structures.

[BibT_eX]

[DOI]

Proceedings of the PPoPP '21: 26th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2021

Concurrent deferred reference counting with constant-time overhead.

[BibT_eX]

[DOI]

Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

Is Asymptotic Cost Analysis Useful in Developing Practical Parallel Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE International Parallel and Distributed Processing Symposium, 2021

The Read-Only Semi-External Model.

[BibT_eX]

[DOI]

Proceedings of the 2nd Symposium on Algorithmic Principles of Computer Systems, 2021

2020

Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2020

Parallelism in Randomized Incremental Algorithms.

[BibT_eX]

[DOI]

J. ACM, 2020

Concurrent Fixed-Size Allocation and Free in Constant Time.

[BibT_eX]

[DOI]

CoRR, 2020

Constant-Time Lazy Snapshots Supporting General Queries on Concurrent Data Structures.

[BibT_eX]

[DOI]

CoRR, 2020

Concurrent Reference Counting and Resource Management in Wait-free Constant Time.

[BibT_eX]

[DOI]

CoRR, 2020

Batch-dynamic Algorithms via Parallel Change Propagation and Applications to Dynamic Trees.

[BibT_eX]

[DOI]

CoRR, 2020

Brief Announcement: Concurrent Fixed-Size Allocation and Free in Constant Time.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

LL/SC and Atomic Copy: Constant Time, Space Efficient Implementations Using Only Pointer-Width CAS.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Distributed Computing, 2020

Randomized Incremental Convex Hull is Highly Parallel.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Optimal Parallel Algorithms in the Binary-Forking Model.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

ParlayLib - A Toolkit for Parallel Algorithms on Shared-Memory Multicore Machines.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

Work-Efficient Batch-Incremental Minimum Spanning Trees with Applications to the Sliding-Window Model.

[BibT_eX]

[DOI]

Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020

The Graph Based Benchmark Suite (GBBS).

[BibT_eX]

[DOI]

Proceedings of the GRADES-NDA'20: Proceedings of the 3rd Joint International Workshop on Graph Data Management Experiences & Systems (GRADES) and Network Data Analytics (NDA), 2020

NVTraverse: in NVRAM data structures, the destination is more important than the journey.

[BibT_eX]

[DOI]

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

Parallel Batch-Dynamic Trees via Change Propagation.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Improved Parallel Cache-Oblivious Algorithms for Dynamic Programming [Extend Abstract].

[BibT_eX]

[DOI]

Proceedings of the 1st Symposium on Algorithmic Principles of Computer Systems, 2020

2019

On Supporting Efficient Snapshot Isolation for Hybrid Workloads with Multi-Versioned Indexes.

[BibT_eX]

[DOI]

Proc. VLDB Endow., 2019

Semi-Asymmetric Parallel Graph Algorithms for NVRAMs.

[BibT_eX]

[DOI]

CoRR, 2019

Delay-Free Concurrency on Faulty Persistent Memory.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Multiversion Concurrency with Bounded Delay and Precise Garbage Collection.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Parallel Batch-Dynamic Graph Connectivity.

[BibT_eX]

[DOI]

Proceedings of the 31st ACM on Symposium on Parallelism in Algorithms and Architectures, 2019

Making concurrent algorithms detectable: poster.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Implementing parallel and concurrent tree structures.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2019

Low-latency graph streaming using compressed purely-functional trees.

[BibT_eX]

[DOI]

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2019

Batch-Parallel Euler Tour Trees.

[BibT_eX]

[DOI]

Thomas Tseng

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

Parallel Range, Segment and Rectangle Queries with Augmented Maps.

[BibT_eX]

[DOI]

Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

Unfair Scheduling Patterns in NUMA Architectures.

[BibT_eX]

[DOI]

Ziv Scully

Proceedings of the 28th International Conference on Parallel Architectures and Compilation Techniques, 2019

2018

Making Concurrent Algorithms Detectable.

[BibT_eX]

[DOI]

CoRR, 2018

Parallel Range and Segment Queries with Augmented Maps.

[BibT_eX]

[DOI]

CoRR, 2018

Efficient Single Writer Concurrency.

[BibT_eX]

[DOI]

CoRR, 2018

The Parallel Persistent Memory Model.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

Parallel Write-Efficient Algorithms and Data Structures for Computational Geometry.

[BibT_eX]

[DOI]

Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, 2018

PAM: parallel augmented maps.

[BibT_eX]

[DOI]

Daniel Ferizovic

Proceedings of the 23rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2018

Implicit Decomposition for Write-Efficient Connectivity Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Algorithmic Building Blocks for Asymmetric Memories.

[BibT_eX]

[DOI]

Proceedings of the 26th Annual European Symposium on Algorithms, 2018

2017

Optimally Scheduling Jobs with Multiple Tasks.

[BibT_eX]

[DOI]

SIGMETRICS Perform. Evaluation Rev., 2017

Parallel lightweight wavelet tree, suffix array and FM-index construction.

[BibT_eX]

[DOI]

Julian Labeit

J. Discrete Algorithms, 2017

Technical Perspective: Functional compilers.

[BibT_eX]

[DOI]

Commun. ACM, 2017

Julienne: A Framework for Parallel Graph Algorithms using Work-efficient Bucketing.

[BibT_eX]

[DOI]

Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures, 2017

Parallel functional arrays.

[BibT_eX]

[DOI]

Ananya Kumar

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Some Sequential Algorithms are Almost Always Parallel.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Analyzing Contention and Backoff in Asynchronous Shared Memory.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Efficient Construction of Probabilistic Tree Embeddings.

[BibT_eX]

[DOI]

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Provably Efficient Scheduling of Dynamically Allocating Programs on Parallel Cache Hierarchies.

[BibT_eX]

[DOI]

Proceedings of the 24th IEEE International Conference on High Performance Computing, 2017

2016

Experimental Analysis of Space-Bounded Schedulers.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2016

Parallel Ordered Sets Using Join.

[BibT_eX]

[DOI]

Daniel Ferizovic

CoRR, 2016

A New Efficient Construction on Probabilistic Tree Embeddings.

[BibT_eX]

[DOI]

CoRR, 2016

Just Join for Parallel Ordered Sets.

[BibT_eX]

[DOI]

Daniel Ferizovic

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Parallel Shortest Paths Using Radius Stepping.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Parallel Algorithms for Asymmetric Read-Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures, 2016

Hierarchical memory management for parallel programs.

[BibT_eX]

[DOI]

Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Efficient Algorithms with Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Efficient Algorithms under Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

CoRR, 2015

Ray Specialized Contraction on Bounding Volume Hierarchies.

[BibT_eX]

[DOI]

Yong He

Comput. Graph. Forum, 2015

Cache efficient functional algorithms.

[BibT_eX]

[DOI]

Commun. ACM, 2015

A Top-Down Parallel Semisort.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Sorting with Asymmetric Read and Write Costs.

[BibT_eX]

[DOI]

Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Coupling Memory and Computation for Locality Management.

[BibT_eX]

[DOI]

Proceedings of the 1st Summit on Advances in Programming Languages, 2015

Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm.

[BibT_eX]

[DOI]

Niklas Baumstark

Proceedings of the Algorithms - ESA 2015, 2015

Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+.

[BibT_eX]

[DOI]

Proceedings of the 2015 Data Compression Conference, 2015

2014

A simple parallel cartesian tree algorithm and its application to parallel suffix tree construction.

[BibT_eX]

[DOI]

ACM Trans. Parallel Comput., 2014

Nearly-Linear Work Parallel SDD Solvers, Low-Diameter Decomposition, and Low-Stretch Subgraphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Beyond Synchronous: New Techniques for External-Memory Graph Connectivity and Minimum Spanning Forest.

[BibT_eX]

[DOI]

Aapo Kyrola

Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

A simple and practical linear-work parallel algorithm for connectivity.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

Phase-concurrent hash tables for determinism.

[BibT_eX]

[DOI]

Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures, 2014

2013

Coalescent-Based Method for Learning Parameters of Admixture Events from Large-Scale Genetic Variation Data.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Reducing contention through priority updates.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Ligra: a lightweight graph processing framework for shared memory.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

Cache and I/O efficent functional algorithms.

[BibT_eX]

[DOI]

Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Program-centric cost models for locality.

[BibT_eX]

[DOI]

Jeremy T. Fineman

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness, 2013

Topic 12: Theory and Algorithms for Parallel Computation - (Introduction).

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2013 Parallel Processing, 2013

Efficient BVH Construction via Approximate Agglomerative Clustering.

[BibT_eX]

[DOI]

Proceedings of the High-Performance Graphics 2013, 2013

2012

Introduction to special issue ALENEX'10.

[BibT_eX]

[DOI]

Dan Halperin

ACM J. Exp. Algorithmics, 2012

Brief announcement: the problem based benchmark suite.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Parallel and I/O efficient set covering algorithms.

[BibT_eX]

[DOI]

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Parallel probabilistic tree embeddings, k-median, and buy-at-bulk network design.

[BibT_eX]

[DOI]

Anupam Gupta

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Greedy sequential maximal independent set and matching are parallel on average.

[BibT_eX]

[DOI]

Jeremy T. Fineman

Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Internally deterministic parallel algorithms can be fast.

[BibT_eX]

[DOI]

Proceedings of the 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012

GraphChi: Large-Scale Graph Computation on Just a PC.

[BibT_eX]

[DOI]

Aapo Kyrola

Carlos Guestrin

Proceedings of the 10th USENIX Symposium on Operating Systems Design and Implementation, 2012

Non-monotonic Self-Adjusting Computation.

[BibT_eX]

[DOI]

Ruy Ley-Wild

Proceedings of the Programming Languages and Systems, 2012

Problem Based Benchmarks.

[BibT_eX]

Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011

NESL.

[BibT_eX]

[DOI]

Proceedings of the Encyclopedia of Parallel Computing, 2011

A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

An Optimization-Based Sampling Scheme for Phylogenetic Trees.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

Generalized Buneman Pruning for Inferring the Most Parsimonious Multi-State Phylogeny.

[BibT_eX]

[DOI]

J. Comput. Biol., 2011

Linear-work greedy parallel approximate set cover and variants.

[BibT_eX]

[DOI]

Richard Peng

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Near linear-work parallel SDD solvers, low-diameter decomposition, and low-stretch subgraphs.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

Scheduling irregular parallel computations on hierarchical caches.

[BibT_eX]

[DOI]

Jeremy T. Fineman

Proceedings of the SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2011

A Simple Parallel Cartesian Tree Algorithm and its Application to Suffix Tree Construction.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

2010

Space profiling for parallel functional programs.

[BibT_eX]

[DOI]

J. Funct. Program., 2010

Parallel approximation algorithms for facility-location problems.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Low depth cache-oblivious algorithms.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2010: Proceedings of the 22nd Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2010

Hierarchical Diagonal Blocking and Precision Reduction Applied to Combinatorial Multigrid.

[BibT_eX]

[DOI]

Proceedings of the Conference on High Performance Computing Networking, 2010

Traceable data types for self-adjusting computation.

[BibT_eX]

[DOI]

Proceedings of the 2010 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2010

Functional parallel algorithms.

[BibT_eX]

[DOI]

Proceedings of the Proceeding of the 15th ACM SIGPLAN international conference on Functional programming, 2010

Succinct Representations of Separable Graphs.

[BibT_eX]

[DOI]

Arash Farzan

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

2009

An experimental analysis of self-adjusting computation.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2009

Beyond nested parallelism: tight bounds on work-stealing overheads for parallel futures.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Brief announcement: low depth cache-oblivious sorting.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Parallel thinking.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2009

2008

Mixed Integer Linear Programming for Maximum-Parsimony Phylogeny Inference.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Compact dictionaries for variable-length keys and data with applications.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2008

Uniquely Represented Data Structures for Computational Geometry.

[BibT_eX]

[DOI]

Daniel Golovin

Virginia Vassilevska

Proceedings of the Algorithm Theory, 2008

Combinable memory-block transactions.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2008: Proceedings of the 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2008

Provably good multicore cache performance for divide-and-conquer algorithms.

[BibT_eX]

[DOI]

Rezaul Alam Chowdhury

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Space-efficient dynamic orthogonal point location, segment intersection, and range reporting.

[BibT_eX]

[DOI]

Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

A New Combinatorial Approach for Sparse Graph Problems.

[BibT_eX]

[DOI]

Virginia Vassilevska

Ryan Williams

Proceedings of the Automata, Languages and Programming, 35th International Colloquium, 2008

Robust Kinetic Convex Hulls in 3D.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2008

2007

Algorithms for Efficient Near-Perfect Phylogenetic Tree Reconstruction in Theory and Practice.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Direct maximum parsimony phylogeny reconstruction from genotype data.

[BibT_eX]

[DOI]

BMC Bioinform., 2007

Scheduling threads for constructive cache sharing on CMPs.

[BibT_eX]

[DOI]

Shimin Chen

Michael Kozuch

Vasileios Liaskovitis

Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

Efficiently Finding the Most Parsimonious Phylogenetic Tree Via Linear Programming.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications, Third International Symposium, 2007

Strongly History-Independent Hashing with Applications.

[BibT_eX]

[DOI]

Daniel Golovin

Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), 2007

Kinetic 3D convex hulls via self-adjusting computation.

[BibT_eX]

[DOI]

Proceedings of the 23rd ACM Symposium on Computational Geometry, 2007

2006

Adaptive functional programming.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 2006

Parallel depth first vs. work stealing schedulers on CMP architectures.

[BibT_eX]

[DOI]

Vasileios Liaskovitis

Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

An experimental analysis of self-adjusting computation.

[BibT_eX]

[DOI]

Proceedings of the ACM SIGPLAN 2006 Conference on Programming Language Design and Implementation, 2006

Simple Reconstruction of Binary Near-Perfect Phylogenetic Trees.

[BibT_eX]

[DOI]

Proceedings of the Computational Science, 2006

Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Kinetic Algorithms Via Self-adjusting Computation.

[BibT_eX]

[DOI]

Proceedings of the Algorithms, 2006

Engineering a compact parallel delaunay algorithm in 3D.

[BibT_eX]

[DOI]

Clemens Kadow

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Compact representations of simplicial meshes in two and three dimensions.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2005

A Library for Self-Adjusting Computation.

[BibT_eX]

[DOI]

Proceedings of the ACM-SIGPLAN Workshop on ML, 2005

Using page residency to balance tradeoffs in tracing garbage collection.

[BibT_eX]

[DOI]

Daniel Spoonhower

Proceedings of the 1st International Conference on Virtual Execution Environments, 2005

Dictionaries using variable-length keys and data, with applications.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

An Experimental Analysis of Change Propagation in Dynamic Trees.

[BibT_eX]

[DOI]

Jorge L. Vittes

Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics, 2005

2004

Effectively sharing a cache among threads.

[BibT_eX]

[DOI]

Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Compact representations of ordered sets.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

Dynamizing static algorithms, with applications to dynamic trees and history independence.

[BibT_eX]

[DOI]

Shan Leung Maverick Woo

Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2004

An Experimental Analysis of a Compact Graph Representation.

[BibT_eX]

Ian A. Kash

Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments and the First Workshop on Analytic Algorithmics and Combinatorics, 2004

2003

Scalable Room Synchronizations.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2003

Automatic Generation of Staged Geometric Predicates.

[BibT_eX]

[DOI]

Aleksandar Nanevski

High. Order Symb. Comput., 2003

Space-efficient finger search on degree-balanced search trees.

[BibT_eX]

[DOI]

Shan Leung Maverick Woo

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Compact representations of separable graphs.

[BibT_eX]

[DOI]

Ian A. Kash

Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2003

Selective memoization.

[BibT_eX]

[DOI]

Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

2002

The Data Locality of Work Stealing.

[BibT_eX]

[DOI]

Robert D. Blumofe

Theory Comput. Syst., 2002

Index Compression through Document Reordering.

[BibT_eX]

[DOI]

Proceedings of the 2002 Data Compression Conference (DCC 2002), 2002

2001

Persistent triangulations Journal of Functional Programming.

[BibT_eX]

[DOI]

J. Funct. Program., 2001

Room synchronizations.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

A Parallel, Real-Time Garbage Collector.

[BibT_eX]

[DOI]

Proceedings of the 2001 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 2001

2000

A Parallel Dynamic-Mesh Lagrangian Method for Simulation of Flows with Dynamic Interfaces.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Supercomputing 2000, 2000

1999

Space-Efficient Scheduling of Nested Parallelism.

[BibT_eX]

[DOI]

ACM Trans. Program. Lang. Syst., 1999

A Provably Time-Efficient Parallel Implementation of Full Speculation.

[BibT_eX]

[DOI]

John Greiner

ACM Trans. Program. Lang. Syst., 1999

Pipelining with Futures.

[BibT_eX]

[DOI]

Margaret Reid-Miller

Theory Comput. Syst., 1999

Provably Efficient Scheduling for Languages with Fine-Grained Parallelism.

[BibT_eX]

[DOI]

Yossi Matias

J. ACM, 1999

Design and Implementation of a Practical Parallel Delaunay Algorithm.

[BibT_eX]

[DOI]

Algorithmica, 1999

On bounding time and space for multiprocessor garbage collection (with retrospective)

[BibT_eX]

[DOI]

Proceedings of the 20 Years of the ACM SIGPLAN Conference on Programming Language Design and Implementation 1979-1999, 1999

On Bounding Time and Space for Multiprocessor Garbage Collection.

[BibT_eX]

[DOI]

Proceedings of the 1999 ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI), 1999

Parallel Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

An Experimental Analysis of Parallel Sorting Algorithms.

[BibT_eX]

[DOI]

Charles E. Leiserson

Theory Comput. Syst., 1998

Fast Set Operations Using Treaps.

[BibT_eX]

[DOI]

Margaret Reid-Miller

Proceedings of the Tenth Annual ACM Symposium on Parallel Algorithms and Architectures, 1998

Pthreads for Dynamic and Irregular Parallelism.

[BibT_eX]

[DOI]

Proceedings of the ACM/IEEE Conference on Supercomputing, 1998

1997

Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors.

[BibT_eX]

[DOI]

IEEE Trans. Parallel Distributed Syst., 1997

Space-Efficient Scheduling of Parallelism with Synchronization Variables.

[BibT_eX]

[DOI]

Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 1997

Space-Efficient Implementation of Nested Parallelism.

[BibT_eX]

[DOI]

Proceedings of the Sixth ACM SIGPLAN Symposium on Principles & Practice of Parallel Programming (PPOPP), 1997

Parallel Algorithms.

[BibT_eX]

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

Parallel Algorithms.

[BibT_eX]

[DOI]

ACM Comput. Surv., 1996

A Comparison of Sorting Algorithms for the Connection Machine CM-2.

[BibT_eX]

Commun. ACM, 1996

Programming Parallel Algorithms.

[BibT_eX]

[DOI]

Commun. ACM, 1996

A Provable Time and Space Efficient Implementation of NESL.

[BibT_eX]

[DOI]

John Greiner

Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, 1996

Developing a Practical Projection-Based Parallel Delaunay Algorithm.

[BibT_eX]

[DOI]

Gary L. Miller

Dafna Talmor

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Solving Linear Recurrences with Loop Raking.

[BibT_eX]

[DOI]

Marco Zagha

J. Parallel Distributed Comput., 1995

Parallelism in Sequential Functional Languages.

[BibT_eX]

[DOI]

John Greiner

Proceedings of the seventh international conference on Functional programming languages and computer architecture, 1995

1994

Implementation of a Portable Nested Data-Parallel Language.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 1994

Parallel Solutions to Geometric Problems in the Scan Model of Computation.

[BibT_eX]

[DOI]

James J. Little

J. Comput. Syst. Sci., 1994

A practical comparison of N-body algorithms.

[BibT_eX]

[DOI]

Proceedings of the Parallel Algorithms, 1994

1991

Collection-oriented languages.

[BibT_eX]

[DOI]

Jay Sipelstein

Proc. IEEE, 1991

Radix sort for vector multiprocessors.

[BibT_eX]

[DOI]

Marco Zagha

Proceedings of the Proceedings Supercomputing '91, 1991

Size and Access Inference for Data-Parallel Programs.

[BibT_eX]

[DOI]

Allan L. Fisher

Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation (PLDI), 1991

1990

Compiling Collection-Oriented Languages onto Massively Parallel Computers.

[BibT_eX]

[DOI]

Gary Sabot

J. Parallel Distributed Comput., 1990

Scan primitives for vector computers.

[BibT_eX]

[DOI]

Marco Zagha

Proceedings of the Proceedings Supercomputing '90, New York, NY, USA, November 12-16, 1990, 1990

Vector Models for Data-Parallel Computing

[BibT_eX]

MIT Press, ISBN: 0-262-02313-X, 1990

1989

Scans as Primitive Parallel Operations.

[BibT_eX]

[DOI]

IEEE Trans. Computers, 1989

Algorithmic Techniques for Computer Vision on a Fine-Grained Parallel Machine.

[BibT_eX]

[DOI]

James J. Little

Todd A. Cass

IEEE Trans. Pattern Anal. Mach. Intell., 1989

Four Vector-Matrix Primitives.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, 1989

1987

Network Learning on the Connection Machine.

[BibT_eX]

[DOI]

Charles R. Rosenberg

Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

1986

CIS: A Massively Concurrent Rule-Based System.

[BibT_eX]

[DOI]