Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

73

PPL
2006

favoriteEmaildiscussreport

134views more PPL 2006»

A Cost Optimal Parallel Algorithm for Patience Sorting

14 years 9 months ago

A Cost Optimal Parallel Algorithm for Patience Sorting

Download ds.lib.kyutech.ac.jp

Takaaki Nakashima, Akihiro Fujiwara

Real-time Traffic

PPL 2006 |

claim paper

Related Content

» On CostOptimal Merge of Two Intransitive Sorted Sequences

» Towards optimizing energy costs of algorithms for shared memory architectures

» Optimizing Parallel Bitonic Sort

» GPUABiSort optimal parallel sorting on stream architectures

» Optimal Sorting Algorithms on Incomplete Meshes with Arbitrary Fault Patterns

» PDM Sorting Algorithms That Take A Small Number of Passes

» AASort A New Parallel Sorting Algorithm for MultiCore SIMD Processors

» Adaptive Binary Sorting Schemes and Associated Interconnection Networks

» An Optimal Parallel Algorithm for Sorting Multisets

Post Info
More Details (n/a)

Added	14 Dec 2010
Updated	14 Dec 2010
Type	Journal
Year	2006
Where	PPL
Authors	Takaaki Nakashima, Akihiro Fujiwara

Comments (0)