Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 237,887,974 papers from all fields of science
Search
Sign In
Create Free Account
Merge algorithm
Known as:
Merge tree
, Balanced k-way merge sort
, K-way merge
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
37 relations
Algorithm
All nearest smaller values
Analysis of parallel algorithms
Array data structure
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Towards Visual Mega-Analysis of Voxel-based Measurement in Brain Cohorts
Guohao Zhang
,
P. Kochunov
,
L. Hong
,
Hamish A. Carr
,
Jian Chen
Eurographics Conference on Visualization
2016
Corpus ID: 1907012
We present a visualization prototype for comparative analysis of factional anisotropy (FA) distributions constructed from three…
Expand
2011
2011
Research on Subjective Trust Model Based on Cloud Model for Open Networks
L. Tao
,
Decai Huang
,
Libin Hong
2011
Corpus ID: 10419630
The subjective trust relationship is uncertain in the open network; it has fuzziness and uncertainty of dual characteristics…
Expand
2008
2008
Visual Tracing of Automatic Ontology Merging
Martin Eller
,
Bernhard Schiemann
Computational Intelligence in Security for…
2008
Corpus ID: 9923202
Modern distributed systems frequently use autonomous software agents that use ontologies for communication. If each agent owns an…
Expand
2008
2008
A Linear List Merging Algorithm
J. Hopcroft
,
J. Ullman
2008
Corpus ID: 54122642
Abstract : A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element…
Expand
2006
2006
An Efficient Data Structure for Maxplus Merge in Dynamic Programming
Ruiming Chen
,
H. Zhou
IEEE Transactions on Computer-Aided Design of…
2006
Corpus ID: 2418330
Dynamic programming is a useful technique to handle slicing floorplan, technology mapping, and buffering problems, where many…
Expand
Review
2005
Review
2005
Using a Hybrid Evolutionary Algorithm to Minimize Variance in Response Time for Multimedia Object Requests
Fawaz S. Al-Anzi
,
A. Allahverdi
J. Math. Model. Algorithms
2005
Corpus ID: 29533061
This research addresses the scheduling problem of multimedia object requests, which is an important problem in information…
Expand
2001
2001
Data classification and management in very large data warehouses
Kiran Chelluri
,
Vijay Kumar
Proceedings Third International Workshop on…
2001
Corpus ID: 19420911
A data warehouse mainly deals with historical data and specialized retrieval. In this research, we classify historical data and…
Expand
2001
2001
TRANSFORMATION OF CORPORATIONS : TOWARDS APPRECIATIVE SERVICE SYSTEMS
M. Takala
,
D. Hawk
2001
Corpus ID: 475645
Corporations are playing a major role in the current societal change. They are an integral part of societies in which they…
Expand
1993
1993
A Log-Structured History Data Access Method (LHAM)
P. O'Neil
,
G. Weikum
High Performance Transaction Systems Workshop
1993
Corpus ID: 2757655
There are numerous applications that require on–line access to a history of business events. Ideally, both historical and current…
Expand
1992
1992
An index implementation supporting fast recovery for the POSTGRES storage system
M. Sullivan
,
Michael A. Olson
[] Eighth International Conference on Data…
1992
Corpus ID: 2026629
The authors present two algorithms for maintaining B-tree index consistency in a database management system which does not use…
Expand