Skip to Main content Skip to Navigation
Journal articles

Sorting permutations and binary strings by length-weighted rearrangements

Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01705181
Contributor : Guillaume Fertin <>
Submitted on : Friday, February 9, 2018 - 10:47:35 AM
Last modification on : Thursday, February 27, 2020 - 1:05:08 AM

Identifiers

Citation

Guillaume Fertin, Carla Negri Lintzmayer, Zanoni Dias. Sorting permutations and binary strings by length-weighted rearrangements. Theoretical Computer Science, Elsevier, 2018, 715, pp.35 - 59. ⟨10.1016/j.tcs.2018.01.012⟩. ⟨hal-01705181⟩

Share

Metrics

Record views

230