Efficient parallel algorithms can be made robust (Q1189859): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
Property / author | |||
Property / author: Paris C. Kanellakis / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Alexander A. Schwarzmann / rank | |||
Normal rank |
Revision as of 10:53, 15 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient parallel algorithms can be made robust |
scientific article |
Statements
Efficient parallel algorithms can be made robust (English)
0 references
27 September 1992
0 references
lower bounds
0 references
robust algorithms
0 references
fault tolerance
0 references
CRCW PRAM
0 references