Asymptotically efficient in-place merging (Q5915346): Difference between revisions
From MaRDI portal
Set profile property. |
Created claim: DBLP publication ID (P1635): journals/tcs/GeffertKP00, #quickstatements; #temporary_batch_1731475607626 |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q54165934 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a stable minimum storage merging algorithm / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4727443 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4057549 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5646378 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sorting with minimum data movement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Selection from read-only memory and sorting with minimum data movement / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Simplified stable merging tasks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Optimality of Linear Merge / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Stable Sorting and Merging with Optimal Space and Time Bounds / rank | |||
Normal rank | |||
Property / DBLP publication ID | |||
Property / DBLP publication ID: journals/tcs/GeffertKP00 / rank | |||
Normal rank |
Latest revision as of 07:30, 13 November 2024
scientific article; zbMATH DE number 1454560
Language | Label | Description | Also known as |
---|---|---|---|
English | Asymptotically efficient in-place merging |
scientific article; zbMATH DE number 1454560 |
Statements
Asymptotically efficient in-place merging (English)
0 references
4 June 2000
0 references
in-place algorithms
0 references
merging
0 references
sorting
0 references