D. E. Knuth’s scientific contributions

What is this page?


This page lists works of an author who doesn't have a ResearchGate profile or hasn't added the works to their profile yet. It is automatically generated from public (personal) data to further our legitimate goal of comprehensive and accurate scientific recordkeeping. If you are this author and want this page removed, please let us know.

Publications (1)


The Art Of Computer Programming, Vol.3 Sorting and Searching
  • Book

January 1998

·

148 Reads

·

3,620 Citations

D. E. Knuth

Citations (1)


... Previous works investigated variants of block-move distances where bounds are imposed on the lengths of at least one of the moved blocks [28,29]. The problem of sorting permutations using 2-bounded block-moves, i.e., adjacent swaps, is easily solved by the Bubble-Sort algorithm [30]. In general, the complexity of sorting a permutation by p-bounded block-moves is unknown for fixed p > 2 , whereas the analogous problem of limiting k − i ≤ f (n) , is NP-hard [28], since Sorting by Transpositions is NP-hard. ...

Reference:

On the parameterized complexity of the median and closest problems under some permutation metrics
The Art Of Computer Programming, Vol.3 Sorting and Searching
  • Citing Book
  • January 1998