Efficient parallel algorithms can be made robust (Q1189859): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Paris C. Kanellakis / rank
Normal rank
 
Property / author
 
Property / author: Q1002109 / rank
Normal rank
 
Property / author
 
Property / author: Paris C. Kanellakis / rank
 
Normal rank
Property / author
 
Property / author: Alexander A. Schwarzmann / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local management of a global resource in a communication network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal bounds for decision problems on the CRCW PRAM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing two-writer atomic registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expected advantage of asynchrony / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimal synchronism needed for distributed consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the time to assure interactive consistency / 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: Parallelism in random access machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms on restartable fail-stop processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a network resource allocation algorithm / 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: How to emulate shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Robust Sorting Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Achieving optimal CRCW PRAM fault-tolerance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385523 / rank
 
Normal rank

Latest revision as of 12:05, 16 May 2024

scientific article
Language Label Description Also known as
English
Efficient parallel algorithms can be made robust
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references