Minimean Merging and Sorting: An Algorithm

DOI10.1137/0207002MaRDI QIDQ4151720zbMATH OpenOpenAlexFDO

Authors R. Michael Tanner

Publication date 1978

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0207002

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cited in

(1)

• On the optimality of tape merge of two lists with similar size

This page was built for publication: Minimean Merging and Sorting: An Algorithm

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