Flashsort

Flashsort is a distribution sorting algorithm showing linear computational complexity for uniformly distributed data sets and relatively little… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2007
012319872007

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
This paper introduces Buffered Adaptive Radix (BARsort) that adds two improvements to the well known right-to-left Radix sorting… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 4
Is this relevant?
2007
2007
This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
1999
1999
Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1996
1996
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random… (More)
  • figure 3
  • table 1
  • figure 8
  • figure 4
  • figure 5
Is this relevant?
1992
1992
The sorting of large data sets is a key step in a great variety of applications such as query processing, polygon rendering… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
1992
1992
Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
1992
1992
Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: Batcher's bitonic sort… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1990
Highly Cited
1990
This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n processor hypercube… (More)
Is this relevant?
1987
1987
We present parallel algorithms for some fundamental problems in computational geometry which have a running time ofO(logn) usingn… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?