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

@article{Bron1972,
  author = {Bron, Coenraad},
  ee = {http://doi.acm.org/10.1145/355602.361317},
  interhash = {4ae679847cd91d3d6dfddd8f153327d4},
  intrahash = {b68c8da501db7bd83e97dc72ba5fe1fd},
  journal = {Commun. ACM},
  number = 5,
  pages = {357-358},
  title = {Merge Sort Algorithm [M1] (Algorithm 426).},
  url = {http://dblp.uni-trier.de/db/journals/cacm/cacm15.html#Bron72},
  volume = 15,
  year = 1972
}

@article{Flores1961,
  author = {Flores, Ivan},
  ee = {http://doi.acm.org/10.1145/321052.321055},
  interhash = {165673c48e6ac130f1536326c8787818},
  intrahash = {9b13510df8e5f3d28dcd8a277a8f29ed},
  journal = {J. ACM},
  number = 1,
  pages = {41-80},
  title = {Analysis of Internal Computer Sorting.},
  url = {http://dblp.uni-trier.de/db/journals/jacm/jacm8.html#Flores61},
  volume = 8,
  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{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
}