MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Tight bounds for the partial-sums problem." – sorted by Relevance.

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

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

3 documents found, showing 1 through 3.

ATOM

Tight bounds for the partial-sums problem
by Scu Erik D. Demaine — 2004 — In Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms
… Tight Bounds for the Partial-Sums Problem Mihai P^atra,scu* Erik D. Demaine* Abstract We close…
Cited by 12 (3 self) – Add To MetaCart

Lower bound for sparse euclidean spanners
by Pankaj K. Agarwal — 2005 — in Proc. of ACM Symp. on Discrete Algorithms (SODA
… of storage is used [4]. Tight bounds for the partial sum problem in a dynamic setting under various models…
Cited by 2 (0 self) – Add To MetaCart

Logarithmic lower bounds in the cell-probe model
by Erik, D. Demaine — 2006 — SIAM Journal on Computing
… ACM Symposium on Theory of Computing (STOC’04), pp. 546–553, and “Tight Bounds for the Partial-Sums…
Cited by 9 (1 self) – Add To MetaCart

Showing 1 through 3.

ATOM

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