Fenwick Trees
Fenwick Tree is a data structure that efficiently supports dynamic prefix sum queries and point updates on an array with logarithmic time complexity.
4
Publications
162
Citations
13
Authors
8
Institutions
Publications per year
2017–2026
2
4
A Scalable Asynchronous Distributed Algorithm for Topic Modeling
Hsiang‐Fu Yu, Cho‐Jui Hsieh, Hyokun Yun et al. · 2015 · 65 citations
An Efficient Insertion Operator in Dynamic Ridesharing Services
Yi Xu, Yongxin Tong, Yexuan Shi et al. · 2019 · 49 citations
1–4 of 4
13
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 13
8

Beihang University
Beijing, China
2 h-index
12 publications
522 citations
State Key Laboratory of Software Development Environment
Beijing, China
1 h-index
6 publications
228 citations
Seattle University
Seattle, United States
1 h-index
1 publications
65 citations
The University of Texas at Austin
Austin, United States
1 h-index
3 publications
195 citations
University of California, Santa Cruz
Santa Cruz, United States
1 h-index
1 publications
65 citations
Computing Center
Khabarovsk, Russia
1 h-index
2 publications
20 citations

King Abdullah University of Science and Technology
Jeddah, Saudi Arabia
1 h-index
2 publications
20 citations
Amazon (United States)
Seattle, United States
1 h-index
1 publications
65 citations
1–8 of 8
TKDE · 1 publications · 38 citations
1
h-index
TVCG · 1 publications · 10 citations
1
h-index
1–2