It was a year after this paper that the Fenwick Tree came out. It compresses storage for the prefix sum into an N-length array instead of 2N-1. This is what's u

It was a year after this paper that the Fenwick Tree came out. It compresses storage for the prefix sum into an N-length array instead of 2N-1. This is what's used in stochastic algorithms for chemical reactions.