1
Hashed sorting is typically faster than hash tables
Benchmarks and theoretical explanation of why and when hashed radix sort beats hash tables.
Reiner’s webpage and articles.
- Popular posts
- 2
- Total points
- 363
- HN comments
- 111
- Rank
- #7,392 personal
Visit reiner.org → On Hacker News Sep 2025 – May 2026
Security & Privacy 1Software Engineering 1Math & Algorithms 1AI & Machine Learning 1
2
Why are neural networks and cryptographic ciphers so similar? (2025)
Several neural network design principles are almost identical to cipher design principles.