New lower bound techniques for distributed leader finding and other problems on rings of processors
From MaRDI portal
Publication:808701
DOI10.1016/0304-3975(91)90193-6zbMath0732.68048WikidataQ59568030 ScholiaQ59568030MaRDI QIDQ808701
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16571
lower bound; randomized algorithms; distributed algorithm; leader election; asynchronous ring of processors
68Q25: Analysis of algorithms and problem complexity
68M10: Network design and communication in computer systems