The communication complexity for decentralized evaluation of functions
From MaRDI portal
Publication:915467
DOI10.1016/0020-0190(90)90021-OzbMath0702.68071OpenAlexW2004519827MaRDI QIDQ915467
Publication date: 1990
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(90)90021-o
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)
Cites Work
- Decentralized extrema-finding in circular configurations of processors
- An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- An improved algorithm for decentralized extrema-finding in circular configurations of processes
This page was built for publication: The communication complexity for decentralized evaluation of functions
