A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets

DOI10.1137/0201004MaRDI QIDQ5645022zbMATH OpenOpenAlexWikidataFDO

Authors Shen Lin, Frank K. Hwang

Publication date 1972

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c5e4449a63eea9277672ef2e2d3f387449f6e2b0

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Cited in

(22)

• Significant improvements to the Ford-Johnson algorithm for sorting
• New algorithms for the LCS problem
• Determining the mode
• Some modified algorithms for Dijkstra's longest upsequence problem
• An improvement of the binary merge algorithm
• Expected time analysis of interpolation merge -- a simple new merging algorithm
• A hashing method for fast set operations
• Optimizing stable in-place merging.
• The heap-mergesort
• On the optimality of tape merge of two lists with similar size
• Improved output-sensitive snap rounding
• From time to space: fast algorithms that yield small and fast data structures
• COMPRESSED PATTERN MATCHING IN JPEG IMAGES
• Merging by the parallel binary search algorithm
• The order of merging operations for queries in inverted file systems
• Fast Evaluation of Union-Intersection Expressions
• Asymptotically efficient in-place merging
• On the average case of MergeInsertion
• Fast and simple sorting using partial information
• Optimal antimatroid sorting
• Parallel multiple search
• A simple algorithm for in-place merging

This page was built for publication: A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets

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