Constant time parallel sorting: An empirical view.
type: Item
instance of: scholarly article
title: Constant time parallel sorting: An empirical view.
zbMATH Open document ID: 1054.68039
DOI: 10.1016/S0022-0000(03)00040-0
author: William Gasarch
author: Evan Golub
author: Clyde Kruskal
published in: Journal of Computer and System Sciences
publication date: 2003-08-19T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1967159
zbMATH Keywords: non-constructive algorithms
MaRDI profile type: Publication
cites work: Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
cites work: Sorting, Approximate Sorting, and Searching in Rounds
cites work: Q4004078
cites work: Sorting in rounds
cites work: Q3702524
cites work: Sorting in one round
cites work: Parallel sorting
cites work: Q3900124
cites work: A survey of constant time parallel sorting
cites work: Parallel Sorting with Constant Time for Comparisons
cites work: Sorting and Merging in Rounds
cites work: Q4002466
cites work: Ramanujan graphs
cites work: Randomness is linear in space
cites work: Extracting Randomness via Repeated Condensing
cites work: Sorting and Selecting in Rounds
cites work: Extracting all the randomness and reducing the error in Trevisan's extractors
cites work: Q3481743
cites work: Explicit Concentrators from Generalized N-Gons
cites work: Parallelism in Comparison Problems
cites work: Expanders that beat the eigenvalue bound: Explicit construction and applications
full work available at URL: s0022-0000(03)00040-0
OpenAlex ID: W2058512113
description: scientific article; zbMATH DE number 1967159