A new data structure for cumulative frequency tables

By P. Fenwick. 1994

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Tight bounds for the partial-sums problem (2004, background): “Besides being a natural range-query and data-structure problem, it has applications to list indexing and dynamic ranking [10], dynamic arrays [23], and arithmetic coding [11].”
Efficient Coalescent Simulation and Genealogical Analysis for Large Sample Sizes (2015, methodology): “We use a binary indexed tree (Fenwick, 1994, 1995) L to track the cumulative number of links subtended by each extant segment (segments are ordered arbitrarily in this cumulative sum over the segments in extant ancestors).”