×

zbMATH — the first resource for mathematics

How good is the information theory bound in sorting? (English) Zbl 0327.68056

MSC:
68Q25 Analysis of algorithms and problem complexity
68W99 Algorithms in computer science
94A15 Information theory (general)
PDF BibTeX Cite
Full Text: DOI
References:
[1] Buck, R.C., Partition of space, Am. math. monthly, 50, 541-544, (1943) · Zbl 0061.30609
[2] Fredman, M.L., On computing the length of longest increasing subsequencies, Discrete math., 11, 29-35, (1975) · Zbl 0312.68027
[3] L. H. Harper, T. H. Payne, J. E. Savage and E. Strauss, Sorting X + Y, Comm. ACM, to appear.
[4] Knuth, D.E., The art of computer programming, Vol. 3, (1973), Addison-Wesley Reading, Mass · Zbl 0191.17903
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.