@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
}

@incollection{benz2010academic,
  abstract = {The PUMA project fosters the Open Access movement und aims at a better support of the researcher’s publication work. PUMA stands for an integrated solution, where the upload of a publication results automatically in an update of both the personal and institutional homepage, the creation of an entry in a social bookmarking systems like BibSonomy, an entry in the academic reporting system of the university, and its publication in the institutional repository. In this poster, we present the main features of our solution.},
  author = {Benz, Dominik and Hotho, Andreas and Jäschke, Robert and Stumme, Gerd and Halle, Axel and Gerlach Sanches Lima, Angela and Steenweg, Helge and Stefani, Sven},
  booktitle = {Research and Advanced Technology for Digital Libraries},
  doi = {10.1007/978-3-642-15464-5_46},
  editor = {Lalmas, Mounia and Jose, Joemon and Rauber, Andreas and Sebastiani, Fabrizio and Frommholz, Ingo},
  interhash = {db94bafecb815048ede11f6d28e5a9f1},
  intrahash = {5711a3b7425fbae328bf0e755defb7dc},
  isbn = {978-3-642-15463-8},
  pages = {417-420},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {Academic Publication Management with PUMA – Collect, Organize and Share Publications},
  url = {http://dx.doi.org/10.1007/978-3-642-15464-5_46},
  volume = 6273,
  year = 2010
}

@book{knappen2009schnell,
  author = {Knappen, Jörg},
  edition = 3,
  interhash = {d320c196eb19cc096cc6ceb610cd3589},
  intrahash = {a9f5a1c6bf90c64a1f70fd427c922000},
  publisher = {Oldenbourg Wissenschaftsverlag},
  title = {Schnell ans ziel mit LaTeX},
  year = 2009
}