Using persistent data structures for adding range restrictions to searching problems

DOI10.1051/ita/1994280100251zbMath0998.68520OpenAlexW4234851536MaRDI QIDQ4362274

Hans-Peter Lenhof, Michiel H. M. 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)

Related Items (6)

A technique for adding range restrictions to generalized searching problems ⋮ Efficient Data Structures for the Orthogonal Range Successor Problem ⋮ Improved data structures for the orthogonal range successor problem ⋮ Unnamed Item ⋮ Generalized substring compression ⋮ Orthogonal Range Searching for Text Indexing

Cites Work

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

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