Sublinear bounds for randomized leader election (Q477103): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by one other user not shown)
aliases / en / 0aliases / en / 0
 
Sublinear Bounds for Randomized Leader Election
description / endescription / en
scientific article
scientific article; zbMATH DE number 6665665
Property / title
 
Sublinear Bounds for Randomized Leader Election (English)
Property / title: Sublinear Bounds for Randomized Leader Election (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1351.68040 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-35668-1_24 / rank
 
Normal rank
Property / published in
 
Property / published in: Distributed Computing and Networking / rank
 
Normal rank
Property / publication date
 
19 December 2016
Timestamp+2016-12-19T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 19 December 2016 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6665665 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2568406555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed agreement in dynamic peer-to-peer networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed approximation algorithms via probabilistic tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for some distributed algorithms for a complete network of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic quorum systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized leader election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient leader election using sense of direction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low Communication Self-stabilization through Randomization / rank
 
Normal rank

Latest revision as of 08:58, 9 July 2024

scientific article; zbMATH DE number 6665665
  • Sublinear Bounds for Randomized Leader Election
Language Label Description Also known as
English
Sublinear bounds for randomized leader election
scientific article; zbMATH DE number 6665665
  • Sublinear Bounds for Randomized Leader Election

Statements

Sublinear bounds for randomized leader election (English)
0 references
Sublinear Bounds for Randomized Leader Election (English)
0 references
0 references
0 references
0 references
0 references
0 references
2 December 2014
0 references
19 December 2016
0 references
distributed algorithm
0 references
leader election
0 references
randomization
0 references
lower bound
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references