scientific article; zbMATH DE number 6469128
From MaRDI portal
Publication:5501238
zbMath1317.68080MaRDI QIDQ5501238
Erik D. Demaine, Mihai Pǎtraşcu
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Online algorithms; streaming algorithms (68W27)
Related Items
Upper and Lower Bounds for Dynamic Data Structures on Strings, 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, Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds, Multidimensional segment trees can do range updates in poly-logarithmic time, Dynamic relative compression, dynamic partial sums, and substring concatenation, Low-light trees, and tight lower bounds for Euclidean spanners, Orthogonal range searching in linear and almost-linear space
