Algorithms
Essays on algorithms: counting, ordering, address spaces and the tricks that make code smaller or faster. 3 articles.
Generating short ordered IDs with any insertion pattern
Giving ordered elements short IDs that reflect their position, whatever order they are inserted in: a naive approach, LSEQ and a tree of IDs.
4 May 2024Counting up to 2^256 unique values using only O(1 byte)
Estimating how many unique values a stream has seen when you do not need the exact number, in a single byte of storage.
21 April 2024On address space sizes
A 64-bit pointer addresses 16 exabytes: what that much address space allows beyond future proofing.
7 April 2024