Asymptotically efficient in-place merging

DOI10.1016/S0304-3975(98)00162-5zbMath0939.68160DBLPjournals/tcs/GeffertKP00WikidataQ54165934 ScholiaQ54165934MaRDI QIDQ5915346

Jyrki Katajainen, Viliam Geffert, Tomi A. Pasanen

Publication date: 4 June 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

sortingmergingin-place algorithms

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Related Items (12)

A simple algorithm for in-place merging ⋮ An in-place algorithm for Klee's measure problem in two dimensions ⋮ Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge ⋮ In-place algorithms for computing (Layers of) maxima ⋮ GENUS AND DIMENSION OF DIGITAL IMAGES AND THEIR TIME- AND SPACE-EFFICIENT COMPUTATION ⋮ Line-segment intersection made in-place ⋮ Space-efficient geometric divide-and-conquer algorithms ⋮ Optimizing stable in-place merging. ⋮ Multiway in-place merging ⋮ Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time ⋮ QuickXsort: a fast sorting scheme in theory and practice ⋮ Context-free languages can be accepted with absolutely no space overhead

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Selection from read-only memory and sorting with minimum data movement
• On a stable minimum storage merging algorithm
• Simplified stable merging tasks
• On the Optimality of Linear Merge
• Sorting with minimum data movement
• Stable Sorting and Merging with Optimal Space and Time Bounds
• A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets

This page was built for publication: Asymptotically efficient in-place merging