Searching for "Optimal Biweighted Binary Trees and the Complexity of Maintaining Partial Sums." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

Optimal Biweighted Binary Trees And The Complexity Of Maintaining Partial Sums
by Haripriyan Hampapuram, Michael, Michael L. Fredman, Siam J. Comput C — 1998 — SIAM Journal on Computing
…OPTIMAL BIWEIGHTED BINARY TREES AND THE COMPLEXITY OF MAINTAINING PARTIAL SUMS # HARIPRIYAN…
Cited by 16 (0 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB