@article{franceschini2005inplace,
  abstract = {We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports. This solves a long-standing open problem, stated explicitly, for example, in Munro and Raman [1992], of whether there exists a sorting algorithm that matches the asymptotic lower bounds on all computational resources simultaneously. [ABSTRACT FROM AUTHOR]},
  author = {Franceschini, Gianni and Geffert, Viliam},
  interhash = {6811ae48c9759f7a67eb6cbf48e06296},
  intrahash = {85343dde3d3317cc952a4b70ffee58c7},
  journal = {Journal of the ACM},
  month = {7},
  number = 4,
  title = {An In-Place Sorting with O(n log n) Comparisons and O(n) Moves.},
  uniqueid = {18067174|buh},
  volume = 52,
  year = 2005
}