An O(n log n) unidirectional distributed algorithm for extrema finding in a circle (Q3956422)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An O(n log n) unidirectional distributed algorithm for extrema finding in a circle |
scientific article |
Statements
An O(n log n) unidirectional distributed algorithm for extrema finding in a circle (English)
0 references
1982
0 references
circular arrangement of n uniquely numbered processes
0 references
maximum number
0 references
asynchronous communicating processes
0 references
distributed systems
0 references
