Sciweavers

739 search results - page 26 / 148
» Sorting Algorithms
Sort
View
DAM
2007
105views more  DAM 2007»
13 years 7 months ago
Recognizing and representing proper interval graphs in parallel using merging and sorting
We present a parallel algorithm for recognizing and representing a proper interval graph in O(log2 n) time with O(m + n) processors on the CREW PRAM, where m and n are the number ...
Jørgen Bang-Jensen, Jing Huang, Louis Ibarr...
BIOCOMP
2006
13 years 9 months ago
Improving the Efficiency of Sorting by Reversals
Sorting signed permutations by reversals is a fundamental problem in computationial molecular biology. In this paper we present an improved algorithm for sorting by reversals. Our...
Yijie Han
VLDB
1997
ACM
126views Database» more  VLDB 1997»
13 years 11 months ago
Dynamic Memory Adjustment for External Mergesort
Sorting is a memory intensive operation whose performance is greatly affected by the amount of memory available as work space. When the input size is unknown or available memory s...
Weiye Zhang, Per-Åke Larson
SPAA
2003
ACM
14 years 23 days ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
CORR
2008
Springer
120views Education» more  CORR 2008»
13 years 7 months ago
Cache-Oblivious Selection in Sorted X+Y Matrices
Let X[0..n - 1] and Y [0..m - 1] be two sorted arrays, and define the m
Mark de Berg, Shripad Thite