Elimination trees and the construction of pools and stacks

DOI10.1007/S002240000072zbMATH Open0893.68003OpenAlexW1976235739WikidataQ126400944 ScholiaQ126400944MaRDI QIDQ1384697FDOQ1384697

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

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

zbMATH Keywords

elimination trees

Mathematics Subject Classification ID

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

Cited In (11)

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

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)