Thumbnail
Access Restriction
Subscribed

Author Larmore, L. L. ♦ Hirschberg, D. S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Diehr and Faaland developed an algorithm that finds the minimum sum of key length pagination of a scroll of n items, and which uses O(n log n) time, solving a problem posed by McCreight. An improved algorithm is given which uses O(n) time.
Description Affiliation: Univ. of California, Irvine (Hirschberg, D. S.) || California State Univ., Dominguez Hills (Larmore, L. L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 28
Issue Number 8
Page Count 3
Starting Page 854
Ending Page 856


Open content in new tab

   Open content in new tab
Source: ACM Digital Library