Merge sort

Known as: Balanced merge sort, Mergesort, Array merging 
In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
The introduction of TimSort as the standard algorithm for sorting in Java and Python questions the generally accepted idea that… (More)
  • figure 1
  • figure 2
Is this relevant?
2012
2012
We design a high-performance parallel merge sort for highly parallel systems. Our merge sort is designed to use more register… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2011
2011
Odd-Even merge sort is a basic problem in computer supported cooperative work in design area. However, it is not effective… (More)
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We present the design of a sample sort algorithm for manycore GPUs. Despite being one of the most efficient comparison-based… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Sort is a fundamental kernel used in many database operations. In-memory sorts are now feasible; sort performance is limited by… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We describe the design of high-performance parallel radix sort and merge sort routines for manycore GPUs, taking advantage of the… (More)
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Ontologies have been established for knowledge sharing and are widely used as a means for conceptually structuring domains of… (More)
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
Highly Cited
1996
Highly Cited
1996
High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the… (More)
  • figure 2.1
  • figure 2.2
  • figure 3.1
  • figure 3.1
  • figure 6.1
Is this relevant?
1990
1990
The complexity of merging two sorted sequences into one is linear in the worst case as well as in the average case. There are… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1988
Highly Cited
1988
We provide tight upper and lower bounds, up to a constant factor, for the number of inputs and outputs (I/OS) between internal… (More)
  • figure 1
  • figure 2
Is this relevant?