Optimal and Practical Algorithms for Sorting on the PDM

IEEE Transactions on Computers - United States
doi 10.1109/tc.2007.70810
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Related search

Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms

SIAM Journal on Computing
MathematicsComputer Science
1989English

Optimal Framework for Reconfiguration of Manufacturing Setups Using Non Dominating Sorting Genetic Algorithms

2017English

Demonstration of Sorting Algorithms on Mobile Platforms

2013English

On Modern Array Algorithms for Optimal Discrete Filtering

Bulletin of the South Ural State University, Series: Mathematical Modelling, Programming and Computer Software
Computational TheorySimulationComputational MathematicsMathematicsModelingSoftware
2018English

Optimal and Nearly Optimal Algorithms for Approximating Polynomial Zeros

Computers and Mathematics with Applications
MathematicsComputational MathematicsSimulationModelingComputational Theory
1996English

Efficient and Practical Algorithms for Discrete Geodesics

English

Tools for Comparing the Results of the Work of Sorting Algorithms

Informatyka Automatyka Pomiary w Gospodarce i Ochronie Środowiska
2018English

Optimizing Sorting With Genetic Algorithms

English

Practical Divide-And-Conquer Algorithms for Polynomial Arithmetic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy