Upper bounds for sorting integers on random access machines (Q789897)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3846872
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds for sorting integers on random access machines |
scientific article; zbMATH DE number 3846872 |
Statements
Upper bounds for sorting integers on random access machines (English)
0 references
1984
0 references
complexity of integer sorting
0 references
random access machine
0 references
0.8522785305976868
0 references
0.8483823537826538
0 references
0.8344380855560303
0 references
