A time-space tradeoff for sorting on non-oblivious machines (Q1152950)
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: A time-space tradeoff for sorting on non-oblivious machines |
scientific article; zbMATH DE number 3723846
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A time-space tradeoff for sorting on non-oblivious machines |
scientific article; zbMATH DE number 3723846 |
Statements
A time-space tradeoff for sorting on non-oblivious machines (English)
0 references
1981
0 references
model of computation
0 references
non-oblivious programs
0 references
0 references
