Skip to content
HomeVideosBooks
AllTopicsTrends
BlogsPodcasts
HistoryListsWatch laterLiked videosFollowing

The videos, books, blogs and podcasts Hacker News keeps recommending, all in one place.

VideosBooksBlogsPodcastsAboutPrivacySettings

Data from Hacker News, HackerTube, HackerBooks, HackerBlogs and Open Library. Credits · Not affiliated with Y Combinator.

HomeVideosBooksBlogsPodcasts
Ctrl K
    Algorithms for Modern HardwareSergey Slotin

    Algorithms for Modern Hardware

    Sergey Slotin · 2022

    Computer Science
    Visit site
    Stats for nerds
    15recommend
    22mentions
    17people
    2022–2026years
    91% recommend9% neutral

    Mentions per year

    20222023202420252026

    What Hacker News says

    1. quirinoApr 2026
      On optimizing binary search: https://en.algorithmica.org/hpc/data-structures/binary-searc...
      thread
    2. barishnamazovJan 2026
      Also want to share B- tree implementation from the Algorithmica HPC book: https://en.algorithmica.org/hpc/data-structures/b-tree/
      thread
    3. josephgJun 2025
      Huh. I'd love to see B-trees thrown in there. Especially using some of the tricks in the excellent "Algorithms for Modern Hardware" book:

      https://en.algorithmica.org/hpc/data-structures/b-tree/

      thread
    4. imurrayJun 2025
      This post is for those interested high-performance matrix multiplication in BQN (an APL-like array language).

      The main thing I got out of it was the footnotes, in particular: https://en.algorithmica.org/hpc/algorithms/matmul/ is a really nice post on fast matrix multiplication, and is a chapter of what looks like a nice online book.

      thread
    5. ashvardanianApr 2025
      I agree that it may not be the most readable format. So far, the best-structured piece on similar topics I’ve seen is Algorithmica: <https://en.algorithmica.org/hpc>.

      I am sure it overlaps in terms of topics, maybe even some examples, but the homepage suggests that the book is about 500 pages long. I generally don’t have a time budget to read that much, and in most cases, I want to play with the code more than read the text, especially when some new IO_uring feature, a metaprogramming tool, or an Assembly instruction comes out.

      Another observation is that people don’t like to read into 5000-word essays on each topic. At best, those become training materials for the next LLMs and will affect future code only indirectly…

      I’m all ears for alternative formats if you have recommendations, as I generally reimplement such projects every couple of years ;)

      thread
    6. josephgOct 2024
      I'd be curious to see how performance would change from storing b-tree entries in a semi-sorted array, and applying various other optimizations from here:

      https://en.algorithmica.org/hpc/data-structures/b-tree/

      The aggregate performance improvements Sergey Slotin gets from applying various "tricks" is insane.

      thread

    Related

    Cover of Introduction to Algorithms
    2007–2026

    Introduction to Algorithms

    Thomas H. Cormen
    274 recommend · 880
    Cover of Computer architecture
    2008–2026

    Computer architecture

    John L. Hennessy
    59 recommend · 110
    Cover of The algorithm design manual
    2007–2026

    The algorithm design manual

    Steven S. Skiena
    195 recommend · 321
    Cover of Grokking Algorithms
    2014–2025

    Grokking Algorithms

    Aditya Y. Bhargava
    42 recommend · 75
    Cover of Algorithms
    2007–2026

    Algorithms

    Robert Sedgewick
    50 recommend · 100
    Cover of Algorithms Illuminated
    2018–2026

    Algorithms Illuminated

    Tim Roughgarden
    9 recommend · 10
    Cover of Introduction to the theory of computation
    2008–2026

    Introduction to the theory of computation

    Michael Sipser
    66 recommend · 96
    Cover of Algorithms in a nutshell
    2009–2024

    Algorithms in a nutshell

    George T. Heineman
    12 recommend · 23