On the adaptiveness of quicksort (2005)

by Gerth Stølting Brodal , Rolf Fagerberg , Gabriel Moruz
Venue:IN: WORKSHOP ON ALGORITHM ENGINEERING & EXPERIMENTS, SIAM
Citations:8 - 1 self

Documents Related by Co-Citation

87 Implementing Quicksort Programs – R Sedgewick - 1978
5 Programming Pearls: how to sort – J L Bentley - 1986
707 Introduction to Algorithms, second edition – Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein - 2001
50 Quicksort – C A R Hoare - 1962
5 Computer Algorithms:Introduction to Design and Analysis – S Baase, A Gelder - 2000
3 Parallelizing fundamental algorithms such as sorting on multi-core processors for EDA acceleration – M Edahiro - 2009
11 Super scalar sample sort – P Sanders, S Winkel - 2004
3962 Computer architecture: a quantitative approach, (3rd edition – J L Hennessy, D A Patterson - 2002
58 Engineering a Sort Function – Jon L. Bentley, M. Douglas Mcilroy - 1993
33 Algorithms and Data Structures – N Wirth - 1985
15 Partition: Algorithm 63," "Quicksort: Algorithm 64," and "Find: Algorithm 65 – C A R Hoare - 1961
15 variant of HEAPSORT with almost optimal number of comparisons – “A S Carlsson
62 Algorithm 64: Quicksort – C A R Hoare - 1961
3 Tradeoffs between branch mispredictions and comparisons for sorting algorithms – G S Brodal, G Moruz - 2005
15 Caches and Algorithms – A G LaMarca - 1996
11 Cache-aware and cache-oblivious adaptive sorting – Gerth Stølting Brodal, Rolf Fagerberg, Gabriel Moruz - 2005
65 A Survey of Adaptive Sorting Algorithms – Vladimir Estivill-Castro, Derick Wood - 1992
59 A new representation for linear lists – L Guibas, E McCreight, M Plass, J Roberts - 1977
145 Computer algorithms : Introduction to design and analysis – S Baase - 1991