Elimination trees and the construction of pools and stacks

DOI10.1007/S002240000072MaRDI QIDQ1384697zbMATHzbMATHOpenAlexWikidataFDO

Authors Nir Shavit, Dan Touitou

Publication date 3 August 1998

Published in Theory of Computing Systems (Search for Journal in Brave)

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

zbMATH Keywords

elimination trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Recommendations

• A scalable lock-free stack algorithm
• Concurrent access of priority queues
• Combining funnels: A dynamic approach to software combining
• A steady state analysis of diffracting trees

Cited in

(11)

• Tasks in modular proofs of concurrent algorithms
• Threshold counters with increments and decrements
• On constructing the elimination tree
• Towards a practical snapshot algorithm
• A Note on the Column Elimination Tree
• A scalable lock-free stack algorithm
• Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
• Read-modify-write networks
• Tasks in modular proofs of concurrent algorithms
• scientific article; zbMATH DE number 1844471 (Why is no real title available?)
• Fast and scalable rendezvousing

This page was built for publication: Elimination trees and the construction of pools and stacks

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