@TechReport{Riv73,
  author =       { Ronald L. Rivest },
  title =        { A fast stable minimum-storage sorting algorithm },
  institutiont = { Institut de Recherche d'Informatique et d'Automatique },
  date =         { 1973-12 },
  OPTyear =      { 1973 },
  OPTmonth =     { December },
  number =       { Rapport de Recherce no. 43 },
  OPTaddress = 	 { Domaine de Voluceau, Rocquencourt 78150 - Le Chesnay, France },
  keywords =     { sorting algorithm, stable, minimum-storage },
  abstract =     {
      An algorithm is presented which sorts $n$ numbers into order in average time
      $O(n(log_2(n))^2)$  using at most  $O((log_2(n))^2)$ bits of additional storage.
      Furthermore, the algorithm is stable (that is, it preserves the initial order of
      equal elements).
                 },
}