Using persistent data structures for adding range restrictions to searching problems

DOI10.1051/ITA/1994280100251MaRDI QIDQ4362274zbMATH OpenOpenAlexFDO

Authors Hans-Peter Lenhof, Michiel Smid

Publication date 24 November 2002

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/92468

Mathematics Subject Classification ID

Searching and sorting (68P10)

Cites work

• scientific article; zbMATH DE number 432808 (Why is no real title available?)
• scientific article; zbMATH DE number 4211552 (Why is no real title available?)
• A dynamic fixed windowing problem
• Adding range restriction capability to dynamic data structures
• Bounded ordered dictionaries in O(log log N) time and O(n) space
• Decomposable searching problems
• Design and implementation of an efficient priority queue
• Efficient data structures for range searching on a grid
• Fractional cascading. I: A data structuring technique
• General methods for adding range restrictions to decomposable searching problems
• Making data structures persistent
• Multidimensional divide-and-conquer
• Preserving order in a forest in less than logarithmic time and linear space
• The design of dynamic data structures

Cited in

(6)

• scientific article; zbMATH DE number 7651193 (Why is no real title available?)
• Efficient Data Structures for the Orthogonal Range Successor Problem
• A technique for adding range restrictions to generalized searching problems
• Improved data structures for the orthogonal range successor problem
• Orthogonal range searching for text indexing
• Generalized substring compression

This page was built for publication: Using persistent data structures for adding range restrictions to searching problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4362274)