Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic (Q1277380)
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: Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic |
scientific article; zbMATH DE number 1248292
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic |
scientific article; zbMATH DE number 1248292 |
Statements
Asymptotics of divide-and-conquer recurrences: Batcher's sorting algorithm and a minimum Euclidean matching heuristic (English)
0 references
21 June 1999
0 references
sorting algorithm
0 references
minimum Euclidean matching
0 references
