Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 241,243,032 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.
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
Review
2011
Review
2011
Observability of Dual AGN in Merging Galaxies
S. Van Wassenhove
,
M. Volonteri
,
L. Mayer
,
M. Dotti
,
J. Bellovary
,
S. Callegari
2011
Corpus ID: 120714215
Supermassive black holes (SMBHs) have been detected in the centers of most nearby massive galaxies. Galaxies today are the…
Expand
2007
2007
On Consistency and Merge of Modal Transition Systems
Dario Fischbein
,
Sebastián Uchitel
2007
Corpus ID: 16247923
In this paper we provide a complete characterization of MTS consistency and propose an algorithm for MTS merging that improves on…
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
2004
2004
Matching SAS ® Data Sets with PROC SQL: If at First You Don't Succeed, Match, Match Again
Imelda C. Go
2004
Corpus ID: 64383970
Two data sets are often matched by using the MERGE and BY statements in a DATA step. If records between the two data sets did not…
Expand
2003
2003
Extracting Relations from XML Documents
Eugene Agichtein
,
C. T. Howard Ho
,
V. Josifovski
,
Joerg Gerhardt
International Conference on Conceptual Modeling
2003
Corpus ID: 1243734
XML is becoming a prevalent format for data exchange. Many XML documents have complex schemas that are not always known, and can…
Expand
2001
2001
TRANSFORMATION OF CORPORATIONS : TOWARDS APPRECIATIVE SERVICE SYSTEMS
M. Takala
,
D. Hawk
,
J. Wilby
,
Janet K. Allen
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
1984
1984
LINEAR TIME AND BRANCHING FOR RECURSION WITH MERGE TIME SEMANTICS
J. de Bakker
,
J. Bergstra
,
J. Klop
1984
Corpus ID: 126175736
We consider two ways of assigning semantics to a class of statements built from a set of atomic actions (the 'alph.abe:'), by…
Expand
1973
1973
A Class of Merging Algorithms
F. Hwang
,
D. Deutsch
JACM
1973
Corpus ID: 19001297
Suppose we are given two disjoint linearly ordered subsets <italic>A</italic> and <italic>B</italic> of a linearly ordered set…
Expand