1. On Computing the Information Theoretic Bound for Sorting
:STEINER, George. On Computing the Information Theoretic Bound for Sorting : Counting the Linear Extensions of Posets. Bonn : Institut für Ökonometrie und Operations Research, 1987. 14 s. Report, No. 87459-OR. [Copy count : 1, currently available 1, at library only 0]