Tighter upper bound for sorting permutations with prefix transpositions

From MaRDI portal
Publication:497672

DOI10.1016/J.TCS.2015.07.059zbMATH Open1330.05004OpenAlexW1131689765MaRDI QIDQ497672FDOQ497672


Authors: Bhadrachalam Chitturi Edit this on Wikidata


Publication date: 25 September 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.07.059




Recommendations




Cites Work


Cited In (8)





This page was built for publication: Tighter upper bound for sorting permutations with prefix transpositions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q497672)