Efficient unbalanced merge-sort

13 years 11 months ago

Download www.mat.uniroma2.it

Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, the merge

Enrico Nardelli, Guido Proietti

Real-time Traffic

Algorithms | ISCI 2006 | Mergesort Algorithms | Successive Merging |

claim paper

» Predicting proteinprotein interactions in unbalanced data using the primary structure of p...

» A gauss function based approach for unbalanced ontology matching

» Efficient implementation of sorting on multicore SIMD CPU architecture

» Efficient Text Classification by Weighted Proximal SVM

» Selfselecting selftuning incrementally optimized indexes

» Scheduling Heterogeneous Wireless Systems for Efficient Spectrum Access

» A note concerning the closest point pair algorithm

» Dynamic load balancing on single and multiGPU systems

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	ISCI
Authors	Enrico Nardelli, Guido Proietti

Comments (0)

Sciweavers

Efficient unbalanced merge-sort

Algorithms | ISCI 2006 | Mergesort Algorithms | Successive Merging |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Sciweavers

Efficient unbalanced merge-sort

Algorithms | ISCI 2006 | Merge­sort Algorithms | Successive Merging |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers

Algorithms | ISCI 2006 | Mergesort Algorithms | Successive Merging |