Sciweavers

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

26

STACS
1995
Springer

favoriteEmaildiscussreport

101views Theoretical Computer Science» more STACS 1995»

On the Average Running Time of Odd-Even Merge Sort

14 years 2 months ago

On the Average Running Time of Odd-Even Merge Sort

Download www.cs.ust.hk

Christine Rüb

Real-time Traffic

STACS 1995 | Theoretical Computer Science |

claim paper

Related Content

» Periodic Merging Networks

» On CostOptimal Merge of Two Intransitive Sorted Sequences

» Optimal Average Case Sorting on Arrays

» Improving the Average Delay of Sorting

» Deterministic Sample Sort For GPUs

» WorkTime Optimal KMerge Algorithms on the PRAM

» Best Increments for the Average Case of Shellsort

» Twoway Replacement Selection

» Multiway InPlace Merging

Post Info
More Details (n/a)

Added	26 Aug 2010
Updated	26 Aug 2010
Type	Conference
Year	1995
Where	STACS
Authors	Christine Rüb

Comments (0)