Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

SIAM Journal on Computing - United States
doi 10.1137/0218041
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial & Applied Mathematics (SIAM)

Related search

Measuring Parallel Performance of Sorting Algorithms

Modern Applied Science
2018English

Optimal Parallel Randomized Renaming

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
1997English

Optimal and Practical Algorithms for Sorting on the PDM

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2008English

An Optimal Hardware-Algorithm for Sorting Using a Fixed-Size Parallel Sorting Device

IEEE Transactions on Computers
HardwareArchitectureMathematicsComputational TheoryTheoretical Computer ScienceSoftware
2000English

Ultrafast Expected Time Parallel Algorithms

Journal of Algorithms
1998English

Efficient Out-Of-Core Sorting Algorithms for the Parallel Disks Model

Journal of Parallel and Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureTheoretical Computer ScienceArtificial IntelligenceSoftware
2011English

Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines

SIAM Journal on Computing
MathematicsComputer Science
1989English

Optimal Parallel Algorithms for Finding Proximate Points, With Applications

IEEE Transactions on Parallel and Distributed Systems
HardwareComputational TheorySignal ProcessingArchitectureMathematics
1998English

Randomized Kaczmarz Algorithms: Exact MSE Analysis and Optimal Sampling Probabilities

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy