Nearly-Linear Time and Massively Parallel Algorithms for $k$-anonymity | Read Paper on Bytez