Bit-optimal election in synchronous rings (Q916342): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Time vs bits / 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 | |||
Property / cites work | |||
Property / cites work: Q3933743 / rank | |||
Normal rank |
Latest revision as of 09:49, 21 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bit-optimal election in synchronous rings |
scientific article |
Statements
Bit-optimal election in synchronous rings (English)
0 references
1990
0 references
bit optimal election
0 references
analysis and complexity of algorithms
0 references
synchronous rings
0 references
0 references
0 references