@techreport{TR-IC-04-04,
  number = {IC-04-04},
  author = {Vinicius José Fortuna and João Meidanis},
  title = {Sorting the Reverse Permutation by Prefix Transpositions},
  month = {April},
  year = {2004}, 
  institution = {Institute of Computing, University of Campinas},
  note = {In English, 20 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       Dias and Meidanis present, without a proof, an algorithm to
       sort the reverse permutation $R_n = [n,n-1,\ldots,1]$ by prefix
       transpositions. In this report we present a new algorithm based
       on the previous one and show a complete formal proof of its
       correctness. From this result we establish a new proved upper
       bound of $n-\lfloor n/4\rfloor$ for the prefix transposition
       distance of $R_n$.
  }
}