Stable leader election in population protocols requires linear time (Q5915694): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
description / endescription / en
scientific article; zbMATH DE number 6916819
scientific article; zbMATH DE number 6924973
Property / DOI
 
Property / DOI: 10.1007/s00446-016-0281-z / rank
Normal rank
 
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1394.68034 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-48653-5_40 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-016-0281-Z / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
24 August 2018
Timestamp+2018-08-24T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 24 August 2018 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6924973 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743261842 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1539727830 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.04246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space Trade-offs in Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-Time Leader Election in Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and Exact Majority in Population Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in networks of passively mobile finite-state sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation by population protocols with a leader / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple population protocol for fast robust approximate majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational power of population protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient self-stabilizing counting population protocols on mobile sensor networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3174936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-optimal counting in population protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speed faults in computation by chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Timing in chemical reaction networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable leader election in population protocols requires linear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank

Latest revision as of 05:27, 28 December 2024

scientific article; zbMATH DE number 6924973
Language Label Description Also known as
English
Stable leader election in population protocols requires linear time
scientific article; zbMATH DE number 6924973

    Statements

    Stable leader election in population protocols requires linear time (English)
    0 references
    0 references
    0 references
    13 August 2018
    0 references
    24 August 2018
    0 references
    population protocols
    0 references
    leader election
    0 references
    time lower bound
    0 references
    chemical reaction network
    0 references

    Identifiers

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