Login / Signup

Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums.

Haripriyan HampapuramMichael L. Fredman
Published in: SIAM J. Comput. (1998)
Keyphrases
  • binary trees
  • worst case
  • optimal solution
  • dynamic programming
  • upper bound
  • data structure
  • computational complexity
  • multi dimensional