A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
From MaRDI portal
Publication:5645022
DOI10.1137/0201004zbMath0235.68015OpenAlexW2069153338WikidataQ63252975 ScholiaQ63252975MaRDI QIDQ5645022
Publication date: 1972
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c5e4449a63eea9277672ef2e2d3f387449f6e2b0
Related Items (21)
A simple algorithm for in-place merging ⋮ On the optimality of tape merge of two lists with similar size ⋮ Determining the mode ⋮ Optimizing stable in-place merging. ⋮ Some modified algorithms for Dijkstra's longest upsequence problem ⋮ Sorting under partial information (without the ellipsoid algorithm). ⋮ An improvement of the binary merge algorithm ⋮ Merging by the parallel binary search algorithm ⋮ Fast Evaluation of Union-Intersection Expressions ⋮ Expected time analysis of interpolation merge -- a simple new merging algorithm ⋮ Improved output-sensitive snap rounding ⋮ A hashing method for fast set operations ⋮ Asymptotically efficient in-place merging ⋮ On the average case of MergeInsertion ⋮ Parallel multiple search ⋮ The order of merging operations for queries in inverted file systems ⋮ The heap-mergesort ⋮ From Time to Space: Fast Algorithms That Yield Small and Fast Data Structures ⋮ COMPRESSED PATTERN MATCHING IN JPEG IMAGES ⋮ Significant improvements to the Ford-Johnson algorithm for sorting ⋮ New algorithms for the LCS problem
This page was built for publication: A Simple Algorithm for Merging Two Disjoint Linearly Ordered Sets
