Academic literature on the topic 'Fenwick tree'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Fenwick tree.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Fenwick tree"

1

Marchini, Stefano, and Sebastiano Vigna. "Compact Fenwick trees for dynamic ranking and selection." Software: Practice and Experience 50, no. 7 (2020): 1184–202. http://dx.doi.org/10.1002/spe.2791.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Любутов, О. Д. "THE USE OF OFFICE APPLICATIONS FOR THE STUDY OF THE SEGMENT TREE IN PREPARING SCHOOLCHILDREN OF THE 8–9 FORMS FOR COMPUTER SCIENCE OLYMPIADS." Вестник МГПУ. Серия Информатика и информатизация образования, no. 1(56) (August 9, 2022). http://dx.doi.org/10.25688/2072-9014.2022.59.1.03.

Full text
Abstract:
В статье рассматривается использование популярного электронного образовательного ресурса MS Excel для изучения дерева Фенвика при подготовке школьников к олимпиадам по информатике. The article considers the use of a popular ELR of MSExcel to explain a Fenwick tree when training students for IT Olympiads.
APA, Harvard, Vancouver, ISO, and other styles
3

Park, Seyoon. "Optimisation of the Query Function of Fenwick Tree With a Proportionately Less Opportunity Cost on the Sum Function Using Varying Orders of Fibonacci Bases." SSRN Electronic Journal, 2024. http://dx.doi.org/10.2139/ssrn.4809152.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cushman, Matthew. "Scaled Fenwick Trees." IEEE Access, 2023, 1. http://dx.doi.org/10.1109/access.2023.3299352.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

YORGEY, BRENT. "You could have invented Fenwick trees." Journal of Functional Programming 35 (2025). https://doi.org/10.1017/s0956796824000169.

Full text
Abstract:
Abstract Fenwick trees, also known as binary indexed trees are a clever solution to the problem of maintaining a sequence of values while allowing both updates and range queries in sublinear time. Their implementation is concise and efficient—but also somewhat baffling, consisting largely of nonobvious bitwise operations on indices. We begin with segment trees, a much more straightforward, easy-to-verify, purely functional solution to the problem, and use equational reasoning to explain the implementation of Fenwick trees as an optimized variant, making use of a Haskell EDSL for operations on
APA, Harvard, Vancouver, ISO, and other styles
6

Wang, Yining, Yi Wu, and Simon S. Du. "Near-Linear Time Local Polynomial Nonparametric Estimation with Box Kernels." INFORMS Journal on Computing, February 3, 2021. http://dx.doi.org/10.1287/ijoc.2020.1021.

Full text
Abstract:
Summary of Contribution: Big data analytics has become essential for modern operations research and operations management applications. Statistics methods, such as nonparametric density and function estimation, play important roles in predictive and exploratory data analysis for economics and operations management problems. In this paper, we concentrate on efficiently computing local polynomial regression estimates. We significantly accelerate the computation of such local polynomial estimates by novel applications of multidimensional binary indexed trees ( Fenwick 1994 ) and lazy memory alloc
APA, Harvard, Vancouver, ISO, and other styles
7

Mendivelso, Juan, Rafael Niquefa, Yoan Pinzón та Germán Hernández. "New Algorithms for δγ-Order Preserving Matching". Ingeniería 23, № 2 (2018). http://dx.doi.org/10.14483/23448393.13248.

Full text
Abstract:
Context: Order-preserving matching regards the relative order of strings. However, its application areas require more flexibility in the matching paradigm. We advance in this direction in this paper that extends our previous work [27].Method: We define γ -order preserving matching as an approximate variant of order-preserving matching. We devise two solutions for it based on segment and Fenwick trees: segtreeBA and bitBA.Results: We experimentally show the efficiency of our algorithms compared to the ones presented in [26] (naiveA and updateBA). Also, we present applications of our approach in
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Fenwick tree"

1

Соколов, М. М., Сергій Олександрович Петров, Сергей Александрович Петров, Serhii Oleksandrovych Petrov та О. О. Воронова. "Разработка и реализация сжатого двухмерного дерева Фенвика для оптимизации обработки D-мерных объектов". Thesis, Видавництво СумДУ, 2013. http://essuir.sumdu.edu.ua/handle/123456789/42590.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Fenwick tree"

1

Bille, Philip, Anders Roy Christiansen, Nicola Prezza, and Frederik Rye Skjoldjensen. "Succinct Partial Sums and Fenwick Trees." In String Processing and Information Retrieval. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-67428-5_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Niquefa, Rafael, Juan Mendivelso, Germán Hernández, and Yoan Pinzón. "Segment and Fenwick Trees for Approximate Order Preserving Matching." In Communications in Computer and Information Science. Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-66963-2_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!