Nearly Optimal List Labeling · HackerPapers discussions

Nearly Optimal List Labeling — mentioned by gaudat

Wed, 19 Feb 2025 11:39:37 GMT

This post links to Quanta [https://www.quantamagazine.org/new-book-sorting-algorithm-al...], which links to the actual paper [https://arxiv.org/abs/2405.00807]. Tbh I was expecting a supercharged Dewey Decimals...

Paper and discussion history. A mention is not an endorsement.

Nearly Optimal List Labeling — mentioned by svat

Sat, 25 Jan 2025 22:36:57 GMT

Both papers are linked very clearly in the article, and it was easy to quickly find them just skimming through the article without even reading: > This problem was introduced in a 1981 paper where "1981 paper" links to https://link.springer.com/chapter/10.1007/3-540-10843-2_34 and in the next paragraph: > Last year, in a study that was presented at the Foundations of Computer Science conference in Chicago, a team of seven researchers where "a study" links to https://arxiv.org/abs/2405.00807 Note that both of these are in the introductory section (third and fourth paragraphs), before the…

Paper and discussion history. A mention is not an endorsement.

Nearly Optimal List Labeling — mentioned by teleforce

Sat, 25 Jan 2025 02:59:37 GMT

Am I the only one that's trying to find the main papers that're being described in the article both the original problem, and the near optimal algorithm paper [1],[2]. Apparently both of them are linked deep inside the article, perhaps Quanta can make it mandatory to list all the reference towards the end of the article, it will be very helpful for the readers. [1] Nearly Optimal List Labeling: https://arxiv.org/abs/2405.00807 [2] A sparse table implementation of priority queues: https://link.springer.com/chapter/10.1007/3-540-10843-2_34

Paper and discussion history. A mention is not an endorsement.