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

DOI10.1137/1.9781611973730.30zbMath1371.68323OpenAlexW4242723385MaRDI QIDQ5363084

Yan Gu, Julian Shun, Guy E. Blelloch, Jeremy T. Fineman, Phillip B. Gibbons

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1.9781611973730.30

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10) Data structures (68P05) Randomized algorithms (68W20)

Related Items (1)

Algorithmic Building Blocks for Asymmetric Memories

This page was built for publication: Sequential Random Permutation, List Contraction and Tree Contraction are Highly Parallel