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)

Related topics

Related topics

37 relations
AlgorithmAll nearest smaller valuesAnalysis of parallel algorithmsArray data structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Investigation of copper-tin transient liquid phase bonding reliability for 3D integration
Copper tin transient liquid phase bonding reliability was investigated with different setups including CuSn to Cu and CuSn to… 
2013
2013
Extracting the Core Structure of Social Networks Using (α, β)-Communities
An (α, β)-community is a connected subgraph C with each vertex in C connected to at least β vertices of C (self-loops counted… 
2012
2012
Adaptations interferences detection and resolution with graph-transformation approach
The adaptation of software applications is a critical need in ubiquitous computing. This adaptation should be done at runtime as… 
2010
2010
Divide and Conquer Algorithms for Publish/Subscribe Overlay Design
Overlay network design for topic-based publish/subscribe systems is of primary importance because the overlay directly impacts… 
2000
2000
Topology-independent region tracking with level sets
This paper presents a new approach to the tracking of regions in an image sequence. Unlike most other methods, the proposed… 
1998
1998
Iterative split-and-merge algorithm for vector quantization codebook generation
We propose a new iterative algorithm for the generation of a codebook in vector quantization. The algorithm starts with an… 
1995
1995
On Sort-Merge Algorithm for Band Joins
The article proposes two ways to improve the sort merge based band join algorithm. The techniques proposed address issues that… 
1995
1995
Stereo image sequence coding based on three-dimensional motion estimation and compensation
1988
1988
A New Design of Prolog-Based Bottom-Up Parsing System With Government-Binding Theory
This paper addresses the problems of movement transformation in Prolog-based bottom-up parsing system. Three principles of… 
1984
1984
Efficient Stream/Array Processing in Logic Programming Languages
The Concurrent Prolog predicate for merging n input streams is investigated, and a compilation technique tor getting its… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)