Bit-optimal election in synchronous rings (Q916342): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59568052, #quickstatements; #temporary_batch_1706075657413
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2013480356 / 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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:49, 21 June 2024

scientific article
Language Label Description Also known as
English
Bit-optimal election in synchronous rings
scientific article

    Statements

    Identifiers