Computational Science – ICCS 2005

DOI10.1007/B136575MaRDI QIDQ5709609zbMATH OpenOpenAlexFDO

Authors Fouad El-Aker

Publication date 30 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136575

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Computational Science - ICCS 2004
• Radix Sorting with No Extra Space
• Power balance and apportionment algorithms for the United States Congress
• Sorting in linear time?
• scientific article; zbMATH DE number 1263219

Cited in

(11)

• An Internal Hybrid Sort Algorithm Revisited
• Fast stable in-place sorting with \(O(n)\) data moves
• Improved fast integer sorting in linear space
• A quicksort algorithm base on radix
• Adapting Radix Sort to the Memory Hierarchy
• Computational Science - ICCS 2004
• scientific article; zbMATH DE number 3915640 (Why is no real title available?)
• Power balance and apportionment algorithms for the United States Congress
• Radix Sorting with No Extra Space
• Radix sort trees in the large
• Introspective sorting and selection revisited

This page was built for publication: Computational Science – ICCS 2005

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