A note on multikey sorting using modified binary insertion trees

DOI10.1016/0305-0548(91)90056-WzbMath0791.68033OpenAlexW2046108536MaRDI QIDQ1184440

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)

Cites Work

• Unnamed Item
• Unnamed Item

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