A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (Q1107315): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q59568105 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3769937 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved algorithm for decentralized extrema-finding in circular configurations of processes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Electing a leader in a synchronous ring / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lower Bounds for Distributed Maximum-Finding Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Unidirectional Algorithm for the Circular Extrema Problem / rank | |||
Normal rank | |||
Latest revision as of 18:35, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors |
scientific article |
Statements
A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors (English)
0 references
1988
0 references
message complexity
0 references
distributed computing
0 references
lower bound
0 references
leader finding on rings of processors
0 references
0 references
