Improved fast integer sorting in linear space
type: Item
instance of: scholarly article
title: Improved fast integer sorting in linear space
zbMATH Open document ID: 1007.68037
author: Yijie Han
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 1853205
MaRDI profile type: Publication
full work available at URL: inco.2001.3053
OpenAlex ID: W2095206322
cites work: Sorting in \(c \log n\) parallel steps
cites work: Improved parallel integer sorting without concurrent writing
cites work: Q4234091
cites work: Improved deterministic parallel integer sorting
cites work: Design and implementation of an efficient priority queue
cites work: An optimally efficient selection algorithm
cites work: Improved bounds for integer sorting in the EREW PRAM model
cites work: A Reliable Randomized Algorithm for the Closest-Pair Problem
cites work: Surpassing the information theoretic bound with fusion trees
cites work: Towards optimal parallel bucket sorting
cites work: Improved nonconservative sequential and parallel integer sorting
cites work: Q2728853
cites work: Q4252316
cites work: Upper bounds for sorting integers on random access machines
cites work: A complexity theory of efficient parallel algorithms
cites work: Q4002466
cites work: Lower bounds for union-split-find related problems on random access machines
cites work: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
cites work: On parallel integer sorting
cites work: Priority queues: Small, monotone and trans-dichotomous
cites work: Q5501813
cites work: Q4250223
DOI: 10.1006/INCO.2001.3053
description: scientific article; zbMATH DE number 1853205