Practical trade‐offs for the prefix‐sum problem
Author:
Affiliation:
1. High Performance Computing Laboratory ISTI‐CNR Pisa Italy
2. Department of Computer Science University of Pisa Pisa Italy
Publisher
Wiley
Subject
Software
Link
https://onlinelibrary.wiley.com/doi/pdf/10.1002/spe.2918
Reference25 articles.
1. FredmanML SaksME. The cell probe complexity of dynamic data structures. Paper presented at: Proceedings of the 21‐st Annual Symposium on Theory of Computing (STOC) Seattle Washington;1989:345‐354.
2. On the complexity of maintaining partial sums;Yao AC;SIAM J Comput,1985
3. Optimal biweighted binary trees and the complexity of maintaining partial sums;Hampapuram H;SIAM J Comput,1998
4. DietzPF. Optimal algorithms for list indexing and subset rank. Paper presented at: Proceedings of the Workshop on Algorithms and Data Structures; .1989:39‐46; Springer New York NY.
5. RamanR RamanV RaoSS. Succinct dynamic data structures. Paper presented at: Proceedings of the Workshop on Algorithms and Data Structures;2001:426‐437; Springer New York NY.
Cited by 5 articles. 订阅此论文施引文献 订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Online evaluation of the Kolmogorov–Smirnov test on arbitrarily large samples;Journal of Computational Science;2023-03
2. Scaled Fenwick Trees;IEEE Access;2023
3. On Representing the Degree Sequences of Sublogarithmic-Degree Wheeler Graphs;String Processing and Information Retrieval;2022
4. Internal Masked Prefix Sums and Its Connection to Fully Internal Measurement Queries;String Processing and Information Retrieval;2022
5. Rank/select queries over mutable bitmaps;Information Systems;2021-07
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3