@TechReport{ABA:95:sort-revisited,
  AUTHOR      = {Ben-Amram, Amir M.},
  YEAR        = {1995},
  TITLE = {``When can we sort in $o(n\log n)$ time ?" Revisited}},
  INSTITUTION = {DIKU (Department of Computer Science)},
  address     = {University of Copenhagen},
  number      = {95/21},
  keywords    = {Sorting Algorithms, Lower Bounds},
  summary     = {This report revisits the results of the JCSS paper of
		 the above title, in view of recent results on sorting 
		 by Andersson, Hagerup, Nilsson and Raman.},
  PUF         = {Tekniske rapport},
}