# Posts

• ## Flajolet–Martin: Reducing the error

This is a follow-up to the previous post on Probabilistic counting and how it reduces the error in the estimate. Interestingly, Bloom filter does something similar, though less effecient.

• ## Probabilistic counting algorithms for data base applications

Given a Multiset $\mathfrak{M}$ of random binary strings each of size $L$. Let $R$, the rank, be the maximum index of the first 1-bit amongst all the binary strings. If $n$ is the number of distinct elements, $2^R \approx n$.

• ## Intro

Hi, I will be writing about Computer Science (CS) and explaining novel algorithms using interactive visualisations. An interview Princeton Startup TV Interview with Robert Sedgewick worth watching ‘cause it’s Sedgewick and the points mentioned about research papers lacking implementations and them not being printed at conferences which suggests another means of presenting algorithms is required.