Cubesort: An optimal sorting algorithm for feasible parallel computers

Robert Cypher; Jorge L. C. Sanz

doi:10.1007/bfb0040412

ScienceGate Book Chapters

BOOK-CHAPTER

Cubesort: An optimal sorting algorithm for feasible parallel computers

Robert Cypher Jorge L. C. Sanz

Year: 2006 Lecture notes in computer science Pages: 456-464 Publisher: Springer Science+Business Media

DOI: 10.1007/bfb0040412

Get Full-Text PDF Get Analytical Report

Keywords:

Sorting Hypercube Parallel computing Computer science Sorting algorithm Binary logarithm Parallel algorithm Asymptotically optimal algorithm Algorithm Range (aeronautics) Log-log plot Combinatorics Mathematics

Metrics

Cited By

0.31

FWCI (Field Weighted Citation Impact)

Refs

0.51

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Algorithms and Data Compression

Physical Sciences → Computer Science → Artificial Intelligence

semigroups and automata theory

Physical Sciences → Computer Science → Computational Theory and Mathematics

DNA and Biological Computing

Life Sciences → Biochemistry, Genetics and Molecular Biology → Molecular Biology

Cubesort: An optimal sorting algorithm for feasible parallel computers

Metrics

Topics

Related Documents

Optimal sorting algorithms for parallel computers

Optimal sorting algorithms for parallel computers

Optimal Sorting Algorithms for Parallel Computers

Cubesort: A parallel algorithm for sorting N data items with S-sorters

An optimal parallel adaptive sorting algorithm