The production of partial orders

Schönhage, A.

Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 229-246.

MR Zbl

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

TY  - CHAP
AU  - Schönhage, A.
TI  - The production of partial orders
BT  - Journées algorithmiques
AU  - Collectif
T3  - Astérisque
PY  - 1976
SP  - 229
EP  - 246
IS  - 38-39
PB  - Société mathématique de France
UR  - http://www.numdam.org/item/AST_1976__38-39__229_0/
LA  - en
ID  - AST_1976__38-39__229_0
ER  -

%0 Book Section
%A Schönhage, A.
%T The production of partial orders
%B Journées algorithmiques
%A Collectif
%S Astérisque
%D 1976
%P 229-246
%N 38-39
%I Société mathématique de France
%U http://www.numdam.org/item/AST_1976__38-39__229_0/
%G en
%F AST_1976__38-39__229_0

Schönhage, A. The production of partial orders, dans Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 229-246. http://www.numdam.org/item/AST_1976__38-39__229_0/

Bibliographie
Cité par

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

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

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

[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

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