Designing reliable algorithms in unreliable memories (Q458451)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Designing reliable algorithms in unreliable memories |
scientific article; zbMATH DE number 6352084
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Designing reliable algorithms in unreliable memories |
scientific article; zbMATH DE number 6352084 |
Statements
Designing reliable algorithms in unreliable memories (English)
0 references
7 October 2014
0 references
resilient searching
0 references
resilient sorting
0 references
resilient search trees
0 references
resilient priority queues
0 references
0 references
0.981463611125946
0 references
0.9159112572669984
0 references
0.8379442691802979
0 references
0.8249737620353699
0 references
0.8246778249740601
0 references
