2 papers
cs.DS2017
Fast Dynamic Arrays
Philip Bille, Anders Roy Christiansen, Mikko Berggren Ettienne +1
We present a highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of elements supporting access in time and insertion and delet…
cs.DS2017
Succinct Partial Sums and Fenwick Trees
Philip Bille, Anders Roy Christiansen, Nicola Prezza +1
We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be ef…