Skip to search formSkip to main contentSkip to account menu

Merge algorithm

Known as: Merge tree, Balanced k-way merge sort, K-way merge 
Merge algorithms are a family of algorithms that take multiple sorted lists as input and produce a single list as output, containing all the elements… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
We present a visualization prototype for comparative analysis of factional anisotropy (FA) distributions constructed from three… 
2011
2011
The subjective trust relationship is uncertain in the open network; it has fuzziness and uncertainty of dual characteristics… 
Review
2011
Review
2011
Supermassive black holes (SMBHs) have been detected in the centers of most nearby massive galaxies. Galaxies today are the… 
2010
2010
Database warehouses support processing very large amounts of data. The workload is primarily composed of SELECT queries; updates… 
2007
2007
In this paper we provide a complete characterization of MTS consistency and propose an algorithm for MTS merging that improves on… 
2007
2007
We present an efficient object detection and tracking technique using still cameras in low contrast conditions. The tracking… 
2006
2006
Dynamic programming is a useful technique to handle slicing floorplan, technology mapping, and buffering problems, where many… 
Review
2005
Review
2005
This research addresses the scheduling problem of multimedia object requests, which is an important problem in information… 
2005
2005
Three-way merging is a technique that is used to reintegrate changes to a document when multiple independently modified copies… 
1984
1984
We consider two ways of assigning semantics to a class of statements built from a set of atomic actions (the 'alph.abe:'), by…