A note on multikey sorting using modified binary insertion trees

DOI10.1016/0305-0548(91)90056-WMaRDI QIDQ1184440zbMATH OpenOpenAlexFDO

Authors Abid M. Elabdalla

Publication date 28 June 1992

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(91)90056-w

zbMATH Keywords

binary insertion treesmultikey sorting

Mathematics Subject Classification ID

Searching and sorting (68P10)

This page was built for publication: A note on multikey sorting using modified binary insertion trees

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