Efficient algorithms with asymmetric read and write costs (Q4606283)
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: Efficient algorithms with asymmetric read and write costs |
scientific article; zbMATH DE number 6846385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient algorithms with asymmetric read and write costs |
scientific article; zbMATH DE number 6846385 |
Statements
2 March 2018
0 references
computational model
0 references
lower bounds
0 references
shortest paths
0 references
non-volatile memory
0 references
sorting networks
0 references
fast Fourier transform
0 references
diamond DAG
0 references
minimum spanning tree
0 references
Efficient Algorithms with Asymmetric Read and Write Costs (English)
0 references
0.6783146858215332
0 references
0.6726223826408386
0 references
0.6715487837791443
0 references
