Rüb, Christine Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Rüb, C. (1995). On the Average Running Time of Odd-Even Merge Sort. In E. W. Mayr, & C. Puech (Eds.), STACS95: 12th Annual Symposium on Theoretical Aspects of Computer Science (pp. 491-501). Berlin: Springer.