Login / Signup

Optimal Bi-Weighted Binary Trees and the Complexity of Maintaining Partial Sums

Haripriyan HampapuramMichael L. Fredman
Published in: FOCS (1993)
Keyphrases
  • binary trees
  • worst case
  • optimal solution
  • computational complexity
  • space complexity
  • exhaustive search
  • series parallel