On the Complexity of Maintaining Partial Sums
From MaRDI portal
Publication:3678702
DOI10.1137/0214022zbMath0564.68072OpenAlexW1980228393MaRDI QIDQ3678702
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0214022
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
An algorithm for handling many relational calculus queries efficiently., Lower bounds for off-line range searching, Lower bounds for set intersection queries, Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems, Dynamic orthogonal range queries in OLAP., Tight lower bounds for halfspace range searching, Biased range trees, The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation, Simplex Range Searching and Its Variants: A Review, Lower bounds on zero-one matrices., On the time-space complexity of reachability queries for preprocessed graphs, Range Medians, Dynamic and static algorithms for optimal placement of resources in a tree, Succinct Partial Sums and Fenwick Trees, Placing resources in a tree: Dynamic and static algorithms, How hard is half-space range searching?, Linear-space data structures for range mode query in arrays, Towards optimal range medians, Lower Bounds on the Complexity of Polytope Range Searching, Partial sums on the ultra-wide word RAM, The effect of corners on the complexity of approximate range searching, Quasi-optimal range searching in spaces of finite VC-dimension, Array Range Queries, Lower bounds for dynamic algebraic problems
