Hashed sorting is typically faster than hash tables (reiner.org) | HN Screenshots

YHacker Newsscreenshots

Screenshot of reiner.org: Hashed sorting is typically faster than hash tables

First screen, captured 1 year ago.

Looks similar

Screenshot of reiner.org: Cuckoo hashing improves SIMD hash tables (and other hash table tradeoffs)

Cuckoo hashing improves SIMD hash tables (and other hash table tradeoffs)(reiner.org)

54 points by ibraheemdev 1 year ago | 0 comments

Screenshot of strchr.com: Hash functions: An empirical comparison (2008)

Hash functions: An empirical comparison (2008)(strchr.com)

32 points by surprisetalk 2 years ago | 10 comments

Screenshot of quotenil.com: Adaptive Hashing

Adaptive Hashing (quotenil.com)

43 points by varjag 1 year ago | 7 comments

Screenshot of rdivyanshu.github.io: Streams, Calculational Proofs and Dafny

Streams, Calculational Proofs and Dafny (rdivyanshu.github.io)

28 points by misonic 2 years ago | 4 comments

Screenshot of reiner.org: Why are neural networks and cryptographic ciphers so similar? (2025)

Why are neural networks and cryptographic ciphers so similar? (2025)(reiner.org)

126 points by jxmorris12 5 months ago | 42 comments

Screenshot of borretti.me: Composable SQL

Composable SQL (borretti.me)

247 points by earnestinger 1 year ago | 120 comments