Efficient unbalanced merge-sort
From MaRDI portal
Publication:2489231
DOI10.1016/j.ins.2005.04.008zbMath1156.68369OpenAlexW2074317266MaRDI QIDQ2489231
Guido Proietti, Enrico Nardelli
Publication date: 16 May 2006
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2005.04.008
Related Items (2)
On the complexity of min-max sorting networks ⋮ On embedding subclasses of height-balanced trees in hypercubes
Cites Work
This page was built for publication: Efficient unbalanced merge-sort