Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums

DOI10.1137/S0097539795291598zbMath0914.68041MaRDI QIDQ4210132

Haripriyan Hampapuram, Michael L. Fredman

Publication date: 21 September 1998

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

data structureslower boundspartial sums

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (6)

Algorithms in the Ultra-Wide Word Model ⋮ Lower bounds on zero-one matrices. ⋮ Semi-group range sum revisited: query-space lower bound tightened ⋮ Partial sums on the ultra-wide word RAM ⋮ Unnamed Item ⋮ Array Range Queries

This page was built for publication: Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums