Fully Dynamic Orthogonal Range Reporting on RAM

DOI10.1137/S0097539703436722zbMath1115.68059MaRDI QIDQ5470742

Christian Worm Mortensen

Publication date: 1 June 2006

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

data structuresrange searchingorthogonal

Mathematics Subject Classification ID

Searching and sorting (68P10) Database theory (68P15) Data structures (68P05)

Related Items

EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES ⋮ Towards an Optimal Method for Dynamic Planar Point Location ⋮ Efficient range searching for categorical and plain data ⋮ Mind the gap! ⋮ Near-optimal quantum algorithms for string problems ⋮ Online parameterized dictionary matching with one gap ⋮ Online recognition of dictionary with one gap ⋮ Space efficient dynamic orthogonal range reporting ⋮ Window queries for intersecting objects, maximal points and approximations using coresets ⋮ Orthogonal range searching in linear and almost-linear space ⋮ Unnamed Item ⋮ A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES ⋮ Improved Dynamic Graph Coloring ⋮ A comparative study of dictionary matching with gaps: limitations, techniques and challenges

This page was built for publication: Fully Dynamic Orthogonal Range Reporting on RAM