A steady state analysis of diffracting trees
From MaRDI portal
Publication:1265162
DOI10.1007/s002240000095zbMath0904.68119WikidataQ127763869 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
68R10: Graph theory (including graph drawing) in computer science
68W10: Parallel algorithms in computer science
Related Items
Linearizable counting networks, Software transactional memory, Sequentially consistent versus linearizable counting networks, A scalable lock-free stack algorithm, An efficient counting network