A refinement of replacement selection

DOI10.1016/S0020-0190(99)00052-6zbMATH Open1339.68064OpenAlexW2011585933WikidataQ126559079 ScholiaQ126559079MaRDI QIDQ294674FDOQ294674

Authors: William E. Wright 

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000526?np=y

Recommendations

• scientific article; zbMATH DE number 1926670
• External selection
• Efficient selection on a binary tree
• Selection from read-only memory and sorting with minimum data movement
• scientific article; zbMATH DE number 1383709

zbMATH Keywords

algorithmsdata structuressortingreplacement selection

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Nonnumerical algorithms (68W05)

Cited In (3)

• Title not available (Why is that?)
• A note on the schemes of replacement and collection
• Title not available (Why is that?)

This page was built for publication: A refinement of replacement selection

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