How good is the information theory bound in sorting?
- 1 April 1976
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1 (4) , 355-361
- https://doi.org/10.1016/0304-3975(76)90078-5
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On computing the length of longest increasing subsequencesDiscrete Mathematics, 1975
- Partition of SpaceThe American Mathematical Monthly, 1943