Improved fast integer sorting in linear space

DOI10.1006/inco.2001.3053zbMath1007.68037OpenAlexW2095206322MaRDI QIDQ1854461

Yijie Han

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3053

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Related Items (2)

Construct a perfect word hash function in time independent of the size of integers ⋮ More Efficient Parallel Integer Sorting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds for sorting integers on random access machines
• On parallel integer sorting
• A complexity theory of efficient parallel algorithms
• Improved nonconservative sequential and parallel integer sorting
• Sorting in \(c \log n\) parallel steps
• Towards optimal parallel bucket sorting
• An optimally efficient selection algorithm
• Improved deterministic parallel integer sorting
• Surpassing the information theoretic bound with fusion trees
• Improved parallel integer sorting without concurrent writing
• Improved bounds for integer sorting in the EREW PRAM model
• Lower bounds for union-split-find related problems on random access machines
• Design and implementation of an efficient priority queue
• A Reliable Randomized Algorithm for the Closest-Pair Problem
• Priority queues: Small, monotone and trans-dichotomous
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

This page was built for publication: Improved fast integer sorting in linear space