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...
| Published in: | Communications of the ACM Vol. 68; no. 9; pp. 11 - 14 |
|---|---|
| Main Author: | |
| Format: | Article |
| Published: |
Association for Computing Machinery
Sep2025
|
| Subjects: | |
| Online Access: | View this record in EBSCOhost |
| Summary: | 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. |
|---|