SOFSEM 2006: Theory and Practice of Computer Science

DOI10.1007/11611257MaRDI QIDQ5897995zbMATH OpenOpenAlexFDO

Authors Pok-Son Kim, Arne Kutzner

Publication date 14 November 2006

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11611257

Mathematics Subject Classification ID

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

Recommendations

• Asymptotically efficient in-place merging
• Asymptotically efficient in-place merging
• scientific article; zbMATH DE number 4001497
• A simple algorithm for in-place merging
• Optimal expected-time algorithms for merging
• Multiway In-Place Merging
• Multiway in-place merging
• An efficient multiway merging algorithm
• The analysis of a simple in-place merging algorithm
• Mathematical Foundations of Computer Science 2003

Cited in

(16)

• scientific article; zbMATH DE number 1437310 (Why is no real title available?)
• Algorithms – ESA 2004
• A Simple Algorithm for Stable Minimum Storage Merging
• A simple algorithm for in-place merging
• Asymptotically efficient in-place merging
• Asymptotically efficient in-place merging
• Optimizing stable in-place merging.
• Multiway In-Place Merging
• Strategies for stable merge sorting
• Merging by Decomposition Revisited
• Merging in maps and in pavings
• scientific article; zbMATH DE number 4001497 (Why is no real title available?)
• Multiway in-place merging
• Optimal merging of sorted data under the mean absolute error criterion
• The analysis of a simple in-place merging algorithm
• Ratio Based Stable In-Place Merging

This page was built for publication: SOFSEM 2006: Theory and Practice of Computer Science

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897995)