Space efficient dynamic stabbing with fast queries

DOI10.1145/780542.780636zbMath1192.68143OpenAlexW2042996023MaRDI QIDQ3581262

Mikkel Thorup

Publication date: 16 August 2010

Published in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/780542.780636

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (4)

Fast and compact regular expression matching ⋮ Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals ⋮ Substring range reporting ⋮ Two-dimensional packet classification and filter conflict resolution in the internet

This page was built for publication: Space efficient dynamic stabbing with fast queries