Breaking the Sorting Barrier for Directed Single-Source Shortest Paths (arxiv.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of arxiv.org: Breaking the Sorting Barrier for Directed Single-Source Shortest Paths

First screen, captured 1 year ago.

Looks similar

Screenshot of arxiv.org: Breaking Quadratic Barriers: A Non-Attention LLM for Ultra-Long Context Horizons

Breaking Quadratic Barriers: A Non-Attention LLM for Ultra-Long Context Horizons (arxiv.org)

59 points by PaulHoule 1 year ago | 23 comments

Screenshot of arxiv.org: The Kernighan-Lin Search Algorithm

The Kernighan-Lin Search Algorithm (arxiv.org)

48 points by optimalsolver 1 year ago | 2 comments

Screenshot of arxiv.org: Breaking the 1.58-bit Barrier for Ternary LLMs

Breaking the 1.58-bit Barrier for Ternary LLMs (arxiv.org)

232 points by matt_d 1 month ago | 37 comments

Screenshot of arxiv.org: Compact Fenwick trees for dynamic ranking and selection (2019)

Compact Fenwick trees for dynamic ranking and selection (2019)(arxiv.org)

28 points by luu 2 years ago | 3 comments

Screenshot of arxiv.org: Is this the simplest (and most surprising) sorting algorithm ever? (2021)

Is this the simplest (and most surprising) sorting algorithm ever? (2021)(arxiv.org)

107 points by gnabgib 1 year ago | 94 comments

Screenshot of arxiv.org: Efficient parallelization of an ubiquitous sequential computation

Efficient parallelization of an ubiquitous sequential computation (arxiv.org)

79 points by cs702 2 years ago | 22 comments