Balancing poset extensions
- 1 January 1984
- journal article
- Published by Springer Nature in Order
- Vol. 1 (2) , 113-126
- https://doi.org/10.1007/bf00565647
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- The Information-Theoretic Bound is Good for MergingSIAM Journal on Computing, 1984
- Two combinatorial applications of the Aleksandrov-Fenchel inequalitiesJournal of Combinatorial Theory, Series A, 1981
- How good is the information theory bound in sorting?Theoretical Computer Science, 1976
- Theorie der Konvexen KörperPublished by Springer Nature ,1934