Top all-time · #21906
Stephan Brumme
Personal blog · create.stephan-brumme.comprogrammingmath
Stephan Brumme's personal blog at create.stephan-brumme.com covers programming and math. Since 2012, 3 different Hacker News readers have linked it 3 times, most often “Length-Limited Prefix Codes”. The last post was in 2021, but the archive is still widely read.
Too few sampled comments (2) to say how often HN recommends it.?
Why HN links it
HN readers link Stephan Brumme's blog for technical write-ups on compression and algorithms, such as length-limited prefix codes and a concurrent Go Sieve of Eratosthenes, with C++ benchmark comparisons.
Summarised by Claude from a sample of 2 HN comments that link here. Each comment is marked recommending, critical or neutral (citing without judging); how this works.
blogging about some weird computer stuff
Most-linked posts?
- Length-Limited Prefix Codes2 people · 2 mentions · first linked 2021-08-20
What Hacker News says?
I've spend hours trying to understand how you apply this theory. The internet is surprisingly absent of actual examples showing how it's done. The best I've found that explains the packag-merge is this page: https://create.stephan-brumme.com/length-limited-prefix-code...
Comment linking /length-limited-prefix-codes/
on “Modern LZ Compression (2019)”Submitted Length-Limited Prefix Codes as a story · 30 points
HN discussionDoes anyone have any benchmarks on how fast this will run? For comparison C++ based implementations range from 13.5 seconds to 0.65 seconds when iterating over 1,000,000,000 elements on an Intel Core i7 860, quad-core, hyperthreading, 2.8Ghz cpu. ( http://create.stephan-brumme.com/eratosthenes/ )
Comment linking /eratosthenes/
on “Concurrent Sieve of Eratosthenes in Go”