Publication:5501238
From MaRDI portal
zbMath1317.68080MaRDI QIDQ5501238
Erik D. Demaine, Mihai Pǎtraşcu
Publication date: 3 August 2015
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
68P05: Data structures
68W27: Online algorithms; streaming algorithms
Related Items
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds, Internal masked prefix sums and its connection to fully internal measurement queries, The optimal all-partial-sums algorithm in commutative semigroups and its applications for image thresholding segmentation, Low-light trees, and tight lower bounds for Euclidean spanners, Orthogonal range searching in linear and almost-linear space, Dynamic relative compression, dynamic partial sums, and substring concatenation, Multidimensional segment trees can do range updates in poly-logarithmic time, Upper and Lower Bounds for Dynamic Data Structures on Strings