Fast timing-based algorithms (Q5137323): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Timing verification by successive approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on shared memory for mutual exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive solutions to the mutual exclusion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An axiomatic proof technique for parallel programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Liveness Properties of Concurrent Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving fast mutual exclusion / rank
 
Normal rank

Revision as of 02:27, 24 July 2024

scientific article; zbMATH DE number 7279991
Language Label Description Also known as
English
Fast timing-based algorithms
scientific article; zbMATH DE number 7279991

    Statements

    Fast timing-based algorithms (English)
    0 references
    0 references
    0 references
    2 December 2020
    0 references
    shared-memory algorithms
    0 references
    mutual exclusion
    0 references
    consensus
    0 references
    timing-based model
    0 references
    contention-free complexity
    0 references

    Identifiers