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… 
1995
1995
Design of Efficient Regular Arrays for Matrix Multiplication by Two-Step Regularization
A two-step regularization method in which first permutation sequences and then broadcast planes are selected is proposed to… 
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… 
1992
1992
An index implementation supporting fast recovery for the POSTGRES storage system
The authors present two algorithms for maintaining B-tree index consistency in a database management system which does not use… 
Highly Cited
1985
Highly Cited
1985
The complexity of parallel sorting
We consider PRAM's with arbitrary computational power for individual processors, infinitely large shared memory and "priority… 
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)