An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
- 1 October 1982
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 4 (4), 758-762
- https://doi.org/10.1145/69622.357194
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- Decentralized extrema-finding in circular configurations of processorsCommunications of the ACM, 1980
- An improved algorithm for decentralized extrema-finding in circular configurations of processesCommunications of the ACM, 1979
- Cellular automata complexity trade-offsInformation and Control, 1971