The average-case parallel complexity of sorting (Q582080)
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 4129997
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The average-case parallel complexity of sorting |
scientific article; zbMATH DE number 4129997 |
Statements
The average-case parallel complexity of sorting (English)
0 references
1989
0 references
parallel algorithms
0 references
average-case complexity
0 references
lower bounds
0 references
comparison trees
0 references
sorting
0 references
0 references
0 references
0.8724878430366516
0 references
0.8407655954360962
0 references
0.8296954035758972
0 references
0.7938275337219238
0 references
0.7918471693992615
0 references
