Skip to search formSkip to main contentSkip to account menu

External sorting

Known as: External sort, External merge, On disk merge 
External sorting is a term for a class of sorting algorithms that can handle massive amounts of data. External sorting is required when the data… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper a distributed stochastic network system with incoming tasks that are classified with priorities is studied. The… 
2011
2011
Predictive models of microclimate under various site conditions in forested headwater stream – riparian areas are poorly… 
2005
2005
Optionality in movement operations is widely held to be fundamentally incompatible with a feature-driven approach to displacement… 
Highly Cited
2004
Highly Cited
2004
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than… 
2003
2003
Computer modeling and simulation has a relatively long history in the prediction of thermal and lighting performance in buildings… 
1990
1990
External single-input single-output sorts can use multiple processors each with a large tournament replacement-selection in… 
1989
1989
Heapsort is an internal sorting method which sorts an array of n records in place in O(n log n) time. Heapsort is generally… 
Review
1989
Review
1989
We add yet another paper on parallel sorting t o the large body of literature on the topic. We briefly survey a new query… 
1984
1984
The problem of sorting n elements using VLSI chips that can sort only q(q < n) elements at a time is considered. The proposed… 
1979
1979
SummaryOpen fractures with neurovascular damage,fractures with extensivesoft tissue damage, compound fractures with joint…