Sorting ::::In-Place:::: with a ::::Worst Case:::: Complexity of ::::n:::: log ::::n::::-1.3::::n:::: + ::::O::::(log::::n::::) Comparisons and epsilon ::::n:::: log ::::n:::: + ::::O::::(1) Transports

Klaus Reinhardt. Sorting ::::In-Place:::: with a ::::Worst Case:::: Complexity of ::::n:::: log ::::n::::-1.3::::n:::: + ::::O::::(log::::n::::) Comparisons and epsilon ::::n:::: log ::::n:::: + ::::O::::(1) Transports. In Toshihide Ibaraki, Yasuyoshi Inagaki, Kazuo Iwama, Takao Nishizeki, Masafumi Yamashita, editors, Algorithms and Computation, Third International Symposium, ISAAC 92, Nagoya, Japan, December 16-18, 1992, Proceedings. Volume 650 of Lecture Notes in Computer Science, pages 489-498, Springer, 1992.