2000 character limit reached
Maintaining partial sums in logarithmic time
Published 5 Jan 2014 in cs.DS | (1401.0921v1)
Abstract: We present a data structure that allows to maintain in logarithmic time all partial sums of elements of a linear array during incremental changes of element's values.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.