A steady state analysis of diffracting trees

DOI10.1007/S002240000095zbMath0904.68119OpenAlexW1984352201WikidataQ127763869 ScholiaQ127763869MaRDI QIDQ1265162

Asaph Zemach, Eli Upfal, Nir Shavit

Publication date: 11 January 1999

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

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

zbMATH Keywords

diffracting trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (5)

Linearizable counting networks ⋮ Software transactional memory ⋮ A scalable lock-free stack algorithm ⋮ An efficient counting network ⋮ Sequentially consistent versus linearizable counting networks

This page was built for publication: A steady state analysis of diffracting trees