DOI10.1016/0020-0190(88)90215-3zbMath0652.68052WikidataQ59568105 ScholiaQ59568105MaRDI QIDQ1107315
Hans L. Bodlaender
Publication date: 1988 Published in: Information Processing Letters (Search for Journal in Brave) Full work available at URL: https://dspace.library.uu.nl/handle/1874/16256
zbMATH Keywords
lower bound; distributed computing; message complexity; leader finding on rings of processors
Mathematics Subject Classification ID
68Q25: Analysis of algorithms and problem complexity
68N25: Theory of operating systems