Deterministic sorting in nearly logarithmic time on the hypercube and related computers
type: Item
instance of: scholarly article
title: Deterministic sorting in nearly logarithmic time on the hypercube and related computers
zbMATH Open document ID: 0795.68050
DOI: 10.1016/0022-0000(93)90043-V
author: Robert Cypher
author: C. Greg Plaxton
published in: Journal of Computer and System Sciences
publication date: 1994-07-27T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 529952
zbMATH Keywords: deterministic sorting
MaRDI profile type: Publication
cites work: Sorting in \(c \log n\) parallel steps
cites work: Q3848155
cites work: On the Number of Stable States in a NOR Network
cites work: A parallel median algorithm
cites work: Theoretical Aspects of VLSI Pin Limitations
cites work: Quotient Networks
cites work: Tight Bounds on the Complexity of Parallel Sorting
cites work: Parallel permutation and sorting algorithms and a new generalized connection network
cites work: A Self-Routing Benes Network and Parallel Permutation Algorithms
cites work: A lower bound for sorting networks based on the shuffle permutation
cites work: Ultracomputers
cites work: Parallel Processing with the Perfect Shuffle
Recommended article: Deterministic sorting in O(nloglogn) time and linear space
Recommended article: A time-space optimal parallel sorting on a hypercube
Recommended article: A super-logarithmic lower bound for hypercubic sorting networks
Recommended article: Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
Recommended article: Tight Bounds on the Complexity of Parallel Sorting
Recommended article: Sorting, linear time and the satisfiability problem
Recommended article: On the upper bound of the complexity of sorting
Recommended article: Q3798234
Recommended article: Tight Comparison Bounds on the Complexity of Parallel Sorting
Recommended article: Q5757092
description: scientific article; zbMATH DE number 529952