Lower Bounds for Dynamic Partial Sums Mihai Pˇatra¸scu Let G be a group. The partial sums problem asks to maintain an array An] of group elements, initialized to zeroes (a.k.a. the identity), under the following - Elements of Dynamic - Document - PDFSEARCH.IO

First Page	Meta Content
	Lower Bounds for Dynamic Partial Sums Mihai Pˇatra¸scu Let G be a group. The partial sums problem asks to maintain an array An] of group elements, initialized to zeroes (a.k.a. the identity), under the following Add to Reading List Document Date: 2009-11-10 15:02:16 Open Document File Size: 243,01 KB Share Result on Facebook Company G. / SIAM Journal / / IndustryTerm hypothetical cell-probe algorithm / / Person Erik D. Demaine / / PublishedMedium SIAM Journal on Computing / / Technology decoding algorithm / hypothetical cell-probe algorithm / simulation / / SocialTag T1 Robust random early detection Computing

Lower Bounds for Dynamic Partial Sums Mihai Pˇatra¸scu Let G be a group. The partial sums problem asks to maintain an array An] of group elements, initialized to zeroes (a.k.a. the identity), under the followingAdd to Reading List