Hacker News
- Nykredit, the 33M dollars mistake http://blog.stermon.com/articles/2014/10/01/nykredit-the-33-million-dollars-mistake 2 comments
Lobsters
- Bloom Filter Sort (bfsort) http://blog.stermon.com/articles/2017/12/06/bloom-filter-sort-bfsort 8 comments compsci , ml
- Elm - Why can't we have nice things? (Monads) http://blog.stermon.com/articles/2018/02/07/elm-why-cant-we-have-nice-things-monads 6 comments programming
- In this blog post we introduce a parallel algorithm, bfsort, based on Bloom Filters, that can sort the array A in O(log n) time and O(m) space where m is the size of: { min, min + 1, min + 2, … , max - 1, max } http://blog.stermon.com/articles/2017/12/06/bloom-filter-sort-bfsort 32 comments programming
- In this blog post we introduce a parallel algorithm, bfsort, based on Bloom Filters, that can sort the array A in O(log n) time and O(m) space where m is the size of: { min, min + 1, min + 2, … , max - 1, max } http://blog.stermon.com/articles/2017/12/06/bloom-filter-sort-bfsort 3 comments compsci
- Using The Rhythm of Counting to generate an infinite many unique (and optimal shortest?) variables http://blog.stermon.com/articles/2017/07/10/haskell-rhythm-of-counting-generate-infinite-variables 2 comments programming
- Elm - Basic Counter example with State from QueryString http://blog.stermon.com/articles/2016/03/26/elm-basic-counter-state-querystring 4 comments programming
- Bloom filters, FNV-1a/Murmur3 hashes and leaked e-mails (F#) http://blog.stermon.com/articles/2014/04/06/bloom-filters-fnv1a-murmur3-and-leaked-emails/ 3 comments programming
- Recipe for bulletproof applications with F# http://blog.stermon.com/articles/2014/01/30/recipe-for-bulletproof-applications/ 3 comments programming