Two lower bounds in asynchronous distributed computation
From MaRDI portal
Publication:808249
DOI10.1016/0022-0000(91)90002-MzbMath0731.68043MaRDI QIDQ808249
Publication date: 1991
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
lower bounds; distributed computation; message complexity; bidirectional ring of n anonymous processors
Related Items
Computing functions on asynchronous anonymous networks, On the bit complexity of distributed computations in a ring with a leader
Cites Work