Electronic Data Sorting

DOI10.1109/TC.1985.5009380MaRDI QIDQ3219779zbMATH OpenFDO

Authors Howard B. Demuth

Publication date 1985

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1985.5009380

zbMATH Keywords

Boundsinformation gatheringitem movingparallel registersorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Measures of information, entropy (94A17)

Recommendations

• scientific article; zbMATH DE number 1344900
• Sorting and selection on dynamic data
• scientific article; zbMATH DE number 6157243
• Sorting expertise
• scientific article; zbMATH DE number 140497
• Sorting with minimum data movement

Cited in

(13)

• Notes on the complexity of sorting in abstract machines
• Noisy sort, a memory-intensive sorting algorithm
• How to sort by walking and swapping on paths and trees
• scientific article; zbMATH DE number 4156243 (Why is no real title available?)
• Sorting arrays by means of swaps
• scientific article; zbMATH DE number 3808957 (Why is no real title available?)
• scientific article; zbMATH DE number 4031006 (Why is no real title available?)
• Analysis of a Modified Address Calculation Sorting Algorithm
• A comparison of order structures for automatic digital computers
• Energy efficient sorting, selection and searching
• Efficient sorting during repetitive statistical computations: Algorithms and an application
• A variant of the Ford-Johnson algorithm that is more space efficient
• Rainbow sort: Sorting at the speed of light

This page was built for publication: Electronic Data Sorting

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