@article{bottger2013vergleich,
  abstract = {Gegenstand dieser Arbeit ist der Vergleich der Sortierverfahren Radixsort, 
Mergesort und Quicksort. Alle drei Algorithmen werden zunächst ausführlich 
vorgestellt und ihre Funktionsweise erläutert. Dabei wird die Komplexität 
und das resultierende Laufzeitverhalten theoretisch betrachtet und 
die daraus entstehenden Vor- und Nachteile diskutiert. In einem Versuch 
werden zudem alle drei Algorithmen unter realen Bedingungen auf einem 
Computer getestet, um die theoretischen Betrachtungen zu untermauern.},
  author = {Böttger, Sebastian},
  interhash = {d4ac1b4f52d6f52958942c14957d6602},
  intrahash = {c49c9ef4dc754980aa36760133790f69},
  school = {University of Kassel},
  title = {Vergleich von Sortierverfahren},
  year = 2013
}

@article{ChlebusV91,
  author = {Chlebus, Bogdan S. and Vrto, Imrich},
  ee = {http://dx.doi.org/10.1016/0743-7315(91)90040-G},
  interhash = {c7968394083da3d42639a280317e365f},
  intrahash = {b144e04820bca889124e7791d330aff6},
  journal = {J. Parallel Distrib. Comput.},
  number = 4,
  pages = {332-337},
  title = {Parallel Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/jpdc/jpdc11.html#ChlebusV91},
  volume = 11,
  year = 1991
}

@article{MartinezR01,
  author = {Martínez, Conrado and Roura, Salvador},
  ee = {http://dx.doi.org/10.1137/S0097539700382108},
  interhash = {156e27cf4b94f720addafeef69fbfef6},
  intrahash = {0e9c2082f1b09156e42de7226786e1ba},
  journal = {SIAM J. Comput.},
  number = 3,
  pages = {683-705},
  title = {Optimal Sampling Strategies in Quicksort and Quickselect.},
  url = {http://dblp.uni-trier.de/db/journals/siamcomp/siamcomp31.html#MartinezR01},
  volume = 31,
  year = 2001
}

@article{Hoare1961,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@book{Cormen2009,
  address = {Cambridge, Masachusetts; London},
  author = {Cormen, Thomas H.},
  interhash = {86b7dad77ef9ceaf383d3b1391e5afbe},
  intrahash = {b3558d43184a025c68dd67e7594c8fe5},
  isbn = {9780262033848 0262033844 9780262533058 0262533057},
  publisher = {The MIT Press},
  refid = {804320768},
  title = {Introduction to algorithms},
  url = {http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844},
  year = 2009
}

@article{Hoare1961,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@article{hoare1961algorithm,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@article{Hoare1961,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@article{Hoare1961,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@inproceedings{inoue2007aasort,
  abstract = {Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and thread-level parallelism. In this paper, we propose a new parallel sorting algorithm, called Aligned-Access sort (AA-sort), for shared-memory multi processors. The AA-sort algorithm takes advantage of SIMD instructions. The key to high performance is eliminating unaligned memory accesses that would reduce the effectiveness of SIMD instructions. We implemented and evaluated the AA-sort on PowerPC® 970MP and Cell Broadband EngineTM. In summary, a sequential version of the AA-sort using SIMD instructions outperformed IBM's optimized sequential sorting library by 1.8 times and GPUTeraSort using SIMD instructions by 3.3 times on PowerPC 970MP when sorting 32 M of random 32-bit integers. Furthermore, a parallel version of AA-sort demonstrated better scalability with increasing numbers of cores than a parallel version of GPUTeraSort on both platforms.},
  acmid = {1299047},
  address = {Washington, DC, USA},
  author = {Inoue, Hiroshi and Moriyama, Takao and Komatsu, Hideaki and Nakatani, Toshio},
  booktitle = {Proceedings of the 16th International Conference on Parallel Architecture and Compilation Techniques},
  doi = {10.1109/PACT.2007.12},
  interhash = {bc1e876542ce12b7385d44386ee04c67},
  intrahash = {68fcf74640b03f0cc2f48b979f2a77c4},
  isbn = {0-7695-2944-5},
  numpages = {10},
  pages = {189--198},
  publisher = {IEEE Computer Society},
  series = {PACT '07},
  title = {AA-Sort: A New Parallel Sorting Algorithm for Multi-Core SIMD Processors},
  url = {http://dx.doi.org/10.1109/PACT.2007.12},
  year = 2007
}

@article{Hoare1961,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@article{Bron1974,
  author = {Bron, Coenraad},
  ee = {http://doi.acm.org/10.1145/361604.361631},
  interhash = {712b38217a78adb45a2797fb12a6c552},
  intrahash = {25501f34498a5562c8c50ed70bea2199},
  journal = {Commun. ACM},
  number = 12,
  pages = 706,
  title = {Merge Sort Algorithm (Remark on Algorithm 426).},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm17.html#Bron74},
  volume = 17,
  year = 1974
}

@book{Cormen2009,
  address = {Cambridge, Masachusetts; London},
  author = {Cormen, Thomas H.},
  interhash = {86b7dad77ef9ceaf383d3b1391e5afbe},
  intrahash = {b3558d43184a025c68dd67e7594c8fe5},
  isbn = {9780262033848 0262033844 9780262533058 0262533057},
  publisher = {The MIT Press},
  refid = {804320768},
  title = {Introduction to algorithms},
  url = {http://www.amazon.de/Introduction-Algorithms-Thomas-H-Cormen/dp/0262033844},
  year = 2009
}

@article{Hoare1961,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@article{Hoare01011962,
  abstract = {A description is given of a new method of sorting in the random-access store of a computer. The method compares very favourably with other known methods in speed, in economy of storage, and in ease of programming. Certain refinements of the method, which may be useful in the optimization of inner loops, are described in the second part of the paper.},
  author = {Hoare, C. A. R.},
  doi = {10.1093/comjnl/5.1.10},
  eprint = {http://comjnl.oxfordjournals.org/content/5/1/10.full.pdf+html},
  interhash = {90334d822bec08f9800dd538623e34f0},
  intrahash = {fa584e8539f5c8d6dbf7bd8cab4578d4},
  journal = {The Computer Journal},
  number = 1,
  pages = {10-16},
  title = {Quicksort},
  url = {http://comjnl.oxfordjournals.org/content/5/1/10.abstract},
  volume = 5,
  year = 1962
}

@article{bottger2013vergleich,
  abstract = {Gegenstand dieser Arbeit ist der Vergleich der Sortierverfahren Radixsort, Mergesort und Quicksort. Alle drei Algorithmen werden zunächst ausführlich vorgestellt und ihre Funktionsweise erläutert. Dabei wird die Komplexität und das resultierende Laufzeitverhalten theoretisch betrachtet und die daraus entstehenden Vor- und Nachteile diskutiert. In einem Versuch werden zudem alle drei Algorithmen unter realen Bedingungen auf einem Computer getestet, um die theoretischen Betrachtungen zu untermauern.},
  author = {Böttger, Sebastian},
  interhash = {d4ac1b4f52d6f52958942c14957d6602},
  intrahash = {c49c9ef4dc754980aa36760133790f69},
  school = {University of Kassel},
  title = {Vergleich von Sortierverfahren},
  year = 2013
}

@article{hoare1961algorithm,
  author = {Hoare, C. A. R.},
  ee = {http://doi.acm.org/10.1145/366622.366644},
  interhash = {bd42d51836f956e2deebeb10b8e5f93a},
  intrahash = {1b58ff39c1c545c2be8114935d3c757d},
  journal = {Commun. ACM},
  number = 7,
  pages = 321,
  title = {Algorithm 64: Quicksort.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm4.html#Hoare61b},
  volume = 4,
  year = 1961
}

@article{journals/cacm/Sedgewick78,
  author = {Sedgewick, Robert},
  ee = {http://doi.acm.org/10.1145/359619.359631},
  interhash = {9a4a22f5ef011caa82c52462824cf636},
  intrahash = {6bb82a1159e0686feee71b28976c7f12},
  journal = {Commun. ACM},
  note = {Corrigendum: CACM 22(6): 368 (1979)},
  number = 10,
  pages = {847-857},
  title = {Implementing Quicksort Programs.},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm21.html#Sedgewick78},
  volume = 21,
  year = 1978
}

@article{Musser:1997:ISS:261387.261395,
  acmid = {261395},
  address = {New York, NY, USA},
  author = {Musser, David R.},
  doi = {10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-\#},
  interhash = {e2eb9a859abb44066bb771e742225e8a},
  intrahash = {2a7233c1bb07caed5327314447ca90d0},
  issn = {0038-0644},
  issue_date = {Aug. 1997},
  journal = {Softw. Pract. Exper.},
  month = aug,
  number = 8,
  numpages = {11},
  pages = {983--993},
  publisher = {John Wiley \& Sons, Inc.},
  title = {Introspective sorting and selection algorithms},
  url = {http://dx.doi.org/10.1002/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-\#},
  volume = 27,
  year = 1997
}

@article{sedgewick1978implementing,
  abstract = {This paper is a practical study of how to implement the Quicksort sorting algorithm and its best variants on real computers, including how to apply various code optimization techniques. A detailed implementation combining the most effective improvements to Quicksort is given, along with a discussion of how to implement it in assembly language. Analytic results describing the performance of the programs are summarized. A variety of special situations are considered from a practical standpoint to illustrate Quicksort's wide applicability as an internal sorting method which requires negligible extra storage.},
  acmid = {359631},
  address = {New York, NY, USA},
  author = {Sedgewick, Robert},
  doi = {10.1145/359619.359631},
  interhash = {9a4a22f5ef011caa82c52462824cf636},
  intrahash = {afad926399892172416b18c7a996f647},
  issn = {0001-0782},
  issue_date = {Oct. 1978},
  journal = {Commun. ACM},
  month = oct,
  number = 10,
  numpages = {11},
  pages = {847--857},
  publisher = {ACM},
  title = {Implementing Quicksort programs},
  url = {http://doi.acm.org/10.1145/359619.359631},
  volume = 21,
  year = 1978
}