Pages that link to "Item:Q5604915"
From MaRDI portal
The following pages link to Samplesort: A Sampling Approach to Minimal Storage Tree Sorting (Q5604915):
Displaying 22 items.
- Communication and energy efficient routing protocols for single-hop radio networks (Q433469) (← links)
- Engineering parallel string sorting (Q513306) (← links)
- Efficient sample sort and the average case analysis of PEsort (Q861251) (← links)
- The analysis of Quicksort programs (Q1225454) (← links)
- Faster deterministic sorting through better sampling. (Q1401197) (← links)
- Range partitioning within sublinear time in the external memory model (Q2039680) (← links)
- Range partitioning within sublinear time: algorithms and lower bounds (Q2220789) (← links)
- Bounds on algorithms for string generation (Q2551691) (← links)
- Fringe analysis for extquick: An in situ distributive external sorting algorithm (Q2639632) (← links)
- An adaptive generic sorting algorithm that uses variable partitioning<sup>∗</sup> (Q2710787) (← links)
- A randomized sorting algorithm on the BSP model (Q2931927) (← links)
- DUAL PIVOT QUICKSORT (Q3166751) (← links)
- Implementation of samplesort: A minimal storage tree sort (Q4055240) (← links)
- Recursive samplesort (Q4155827) (← links)
- Massively Parallel Simulations of Binary Black Hole Intermediate-Mass-Ratio Inspirals (Q4631994) (← links)
- RANDOMIZED SORTING ON THE POPS NETWORK (Q4675883) (← links)
- Optimal sampling strategies for quicksort (Q4858238) (← links)
- Direct bulk-synchronous parallel algorithms (Q5056124) (← links)
- In-Place Parallel Super Scalar Samplesort (IPSSSSo) (Q5111694) (← links)
- A limit theorem for “quicksort” (Q5750394) (← links)
- Recognizing the tractability in big data computing (Q5918820) (← links)
- Sublinear-time reductions for big data computing (Q5970839) (← links)
