Skip to search formSkip to main contentSkip to account menu

Flashsort

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Pengurutan data secara umum didefinisikan sebagai suatu proses untuk mengatur suatu kumpulan objek dalam urutan tertentu. Ada… 
2007
2007
A summary of the results achieved in the paper \Optimal Randomized Parallel Algorithms for Computational Geometry," by Reif and… 
2007
2007
  • A. Maus, S. Gjessing
  • International Conference on Software Engineering…
  • 2007
  • Corpus ID: 13893866
This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level… 
2005
2005
We present parallel algorithms for some fundamental problems in computational geometry which have a running time ofO(logn) usingn… 
Highly Cited
1998
Highly Cited
1998
Abstract. We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The… 
1996
1996
Many sorting algorithms that perform well on uniformly distributed data suffer significant performance degradation on non-random… 
Highly Cited
1992
Highly Cited
1992
Flashsort [RV83,86] and Samplesort [HC83] are related parallel sorting algorithms proposed in the literature. Both utilize a… 
Highly Cited
1991
Highly Cited
1991
Sorting is arguably the most studied problem in computer science, both because it is used as a substep in many applications and… 
Highly Cited
1990
Highly Cited
1990
Abstract This paper presents a deterministic sorting algorithm, called Sharesort, that sorts n records on an n -processor… 
1986
1986
The ever-decreasing cost of computer processors has created a great interest in multi-processor computers. However, along with…