Counting sort

Known as: Ultrasort, Set sort, Tally sort 
In computer science, counting sort is an algorithm for sorting a collection of objects according to keys that are small integers; that is, it is an… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1960-2016
0246819602016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Optimization of sorting algorithms is an ongoing research and delivers faster and less space consuming algorithms. The Counting… (More)
Is this relevant?
2014
2014
Counting sort is a simple, stable and efficient sorting algorithm with linear running time, which is a fundamental building block… (More)
Is this relevant?
2013
2013
The live migration of virtual machines is an important technique in the area of virtualization, and it has been used for load… (More)
  • figure 1
  • figure 5
  • figure 10
  • figure 11
  • figure 6
Is this relevant?
2013
2013
This paper investigates two sorting algorithms: counting sort and a variation, occurrence sort, which also removes duplicate… (More)
  • figure 2
  • figure 3
  • figure 1
  • figure 6
  • figure 8
Is this relevant?
2009
2009
Counting sort is a simple, stable and efficient sort algorithm with linear running time, which is a fundamental building block… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
2007
2007
We consider two problems. First, sorting of n integer keys from the [0, 2 − 1] range, stored in p stations of a single-hop and… (More)
Is this relevant?
2007
2007
This paper proposes a single-chip scalable and compact field programmable gate array (FPGA) based architecture of a modified… (More)
  • table I
  • table II
  • figure 1
  • figure 3
  • figure 2
Is this relevant?
2001
2001
In this article, performance limitations of the particle advance in a particle-in-cell (PIC) simulation are discussed. It is… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2000
2000
Let D be a totally ordered set. Call an n -block, a Cartesian product of n closed and possibly empty intervals of D. Let sort be… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
Is this relevant?
1996
1996
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalized communication (AAPC) over… (More)
  • figure 4
  • table 1
  • table 2
  • table 3
Is this relevant?