Scaled Fenwick Trees
A novel data structure that enables the storage and retrieval of linear array numeric data with logarithmic time complexity updates, range sums, and rescaling is introduced and studied. Computing sums of ranges of arrays of numbers is a common computational problem encountered in data compression, c...
Main Author: | Matthew Cushman |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2023-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10196100/ |
Similar Items
-
On general partial Gaussian sums
by: Ganglian Ren, et al.
Published: (2016-11-01) -
A new sum of graphs and caterpillar trees
by: Nelson Berrocal Huamaní, et al.
Published: (2022-03-01) -
On a Spanning k-Tree in which Specified Vertices Have Degree Less Than k
by: Matsumura Hajime
Published: (2015-02-01) -
Analysis of annual sums of precipitation in Serbia
by: Stanojević Gorica
Published: (2012-01-01) -
A note on the variable sum exdeg index/coindex of trees
by: Marjan Matejic, et al.
Published: (2020-12-01)