An Algorithm for a Better Bookshelf.
The article focuses on the bookshelf problem, or "list labeling" problem within the field of computer science. The author explains that researchers have struggled to improve upon an algorithm with a logarithmic cost for adding new entries, but recent breakthroughs have produced a new approach that c...
| Publicado en: | Communications of the ACM Vol. 68; no. 9; pp. 11 - 14 |
|---|---|
| Autor principal: | |
| Formato: | Artículo |
| Publicado: |
Association for Computing Machinery
Sep2025
|
| Materias: | |
| Acceso en línea: | Ver este registro en EBSCOhost |
| fields | @attributes: recordID: 1 pdfLink: plink: https://search.ebscohost.com/login.aspx?direct=true&db=hlh&AN=187620995&site=ehost-live header: @attributes: shortDbName: hlh uiTerm: 187620995 longDbName: Humanities International Complete uiTag: AN controlInfo: bkinfo: jinfo: jid: 00010782 ACM jtl: Communications of the ACM issn: 00010782 maglogo: N pubinfo: dt: Sep2025 vid: 68 iid: 9 pid: 68 pub: Association for Computing Machinery artinfo: ui: 187620995 10.1145/3743656 ppf: 11 ppct: 3 formats: tig: atl: An Algorithm for a Better Bookshelf. aug: au: Klarreich, Erica affil: Berkeley, Berkeley, California, USA su: Algorithms Algorithm research Logarithms Data analysis Big data Bookshelf (Library management system) sug: subj: Algorithms Algorithm research Logarithms Data analysis Big data Bookshelf (Library management system) ab: The article focuses on the bookshelf problem, or "list labeling" problem within the field of computer science. The author explains that researchers have struggled to improve upon an algorithm with a logarithmic cost for adding new entries, but recent breakthroughs have produced a new approach that comes close to the theoretical lower limit. This development could make list labeling more efficient in large-scale data applications. pubtype: Periodical doctype: Article src: R language: English refInfo: copyright: @attributes: flag: Y dt: @attributes: year: 2025 holdings: @attributes: islocal: N |
|---|