The production of partial orders
Journées algorithmiques, Astérisque, no. 38-39 (1976), p. 229-246
@incollection{AST_1976__38-39__229_0,
     author = {Sch\"onhage, A.},
     title = {The production of partial orders},
     booktitle = {Journ\'ees algorithmiques},
     author = {Collectif},
     series = {Ast\'erisque},
     publisher = {Soci\'et\'e math\'ematique de France},
     number = {38-39},
     year = {1976},
     pages = {229-246},
     zbl = {0383.68053},
     mrnumber = {464681},
     language = {en},
     url = {http://www.numdam.org/item/AST_1976__38-39__229_0}
}
Schönhage, A. The production of partial orders, in Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 229-246. http://www.numdam.org/item/AST_1976__38-39__229_0/

[1] Ford L. R. and Johnson S. M., : "A Tournament Problem", Amer. Math. Monthly 66, 387-389 (1959). | Article | MR 103159 | Zbl 0092.01303

[2] Hwang F. K. and Lin S. : "Optimal Merging of 2 Elements with n Elements" Acta Informatica 1, 145-158 (1971). | Article | MR 329312 | Zbl 0221.05017

[3] Knuth D. E. : "The Art of Computer Programming", vol. 3, (Addison- Wesley, 1973). | MR 445948 | Zbl 0302.68010

[4] Pratt V. and Yao F. : "On lower bounds for computing the i-th largest element", Proc. 14 th Ann. IEEE Symp. on Switching and Automata Theory, (1973) 70-81. | MR 468319

[5] Schonhage A. , Paterson M. and Pippenger N. : "Finding the Median" Theory of Comp. Report N° 6 (April 1975), Univ. of Warwick. | MR 428794 | Zbl 0335.68033