Elimination trees and the construction of pools and stacks

DOI10.1007/s002240000072zbMath0893.68003OpenAlexW1976235739WikidataQ126400944 ScholiaQ126400944MaRDI QIDQ1384697

Dan Touitou, Nir Shavit

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)

Related Items (6)

Tasks in modular proofs of concurrent algorithms ⋮ Fast and scalable rendezvousing ⋮ Read-modify-write networks ⋮ A scalable lock-free stack algorithm ⋮ Threshold counters with increments and decrements ⋮ Towards a practical snapshot algorithm

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