![](/img/cover-not-exists.png)
Tighter upper bound for sorting permutations with prefix transpositions
Chitturi, BhadrachalamVolume:
602
Language:
english
Journal:
Theoretical Computer Science
DOI:
10.1016/j.tcs.2015.07.059
Date:
October, 2015
File:
PDF, 412 KB
english, 2015