Primitives for asynchronous list compression

DOI10.1007/BF01184934MaRDI QIDQ4311640zbMATH OpenOpenAlexFDO

Authors

Publication date 30 October 1994

Published in Mathematical Systems Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01184934

zbMATH Keywords

asynchronous processorspath compression

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10)

Recommendations

• Analysis of an asynchronous PRAM algorithm
• scientific article; zbMATH DE number 177853
• A Model for Asynchronous Shared Memory Parallel Computation
• Work-Optimal Asynchronous Algorithms for Shared Memory Parallel Computers
• The Parallel Simplicity of Compaction and Chaining

Cites work

• Efficiency of a Good But Not Linear Set Union Algorithm
• Randomized wait-free concurrent objects (extended abstract)
• Worst-case Analysis of Set Union Algorithms

Cited in

(1)

• The queue-read queue-write asynchronous PRAM model

This page was built for publication: Primitives for asynchronous list compression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4311640)