𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Sorting and Selection in Posets

✍ Scribed by Daskalakis, Constantinos; Karp, Richard M.; Mossel, Elchanan; Riesenfeld, Samantha J.; Verbin, Elad

Book ID
118161181
Publisher
Society for Industrial and Applied Mathematics
Year
2011
Tongue
English
Weight
349 KB
Volume
40
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Introspective Sorting and Selection Algo
Introspective Sorting and Selection Algorithms
✍ DAVID R. MUSSER πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 93 KB

Quicksort is the preferred in-place sorting algorithm in many contexts, since its average computing time on uniformly distributed inputs is Θ(N log N), and it is in fact faster than most other sorting algorithms on most inputs. Its drawback is that its worst-case time bound is Θ(N 2 . Previous attem

Introspective sorting and selection revi
Introspective sorting and selection revisited
✍ John D. Valois πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 221 KB

We describe two improvements to introspective sorting and selection algorithms: a simple rule for finegrained introspection that detects potential worst-case performance after only a small constant number of partitioning steps, and the use of remedial randomization as an intervention strategy in ord

Sorting and Selecting in Rounds
Sorting and Selecting in Rounds
✍ Pippenger, Nicholas πŸ“‚ Article πŸ“… 1987 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 940 KB