Improved data structures for the orthogonal range successor problem
From MaRDI portal
Publication:617543
DOI10.1016/J.COMGEO.2010.09.001zbMATH Open1209.65027OpenAlexW1991365862MaRDI QIDQ617543FDOQ617543
Wing-Kai Hon, Biing-Feng Wang, Chih-Chiang Yu
Publication date: 21 January 2011
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.09.001
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Compressed representations of sequences and full-text indexes
- Using persistent data structures for adding range restrictions to searching problems
- Efficient worst-case data structures for range searching
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- Range Non-overlapping Indexing and Successive List Indexing
- A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
- Rank and select revisited and extended
- Orthogonal range searching in linear and almost-linear space
- Finding Patterns in Given Intervals
Cited In (11)
- Title not available (Why is that?)
- Substring range reporting
- Reporting and counting maximal points in a query orthogonal rectangle
- Closed factorization
- Space-efficient fully dynamic DFS in undirected graphs
- Two-dimensional range successor in optimal time and almost linear space
- Succinct and Implicit Data Structures for Computational Geometry
- Orthogonal Range Searching for Text Indexing
- Substring Range Reporting
- Title not available (Why is that?)
- Space efficient data structures for dynamic orthogonal range counting
This page was built for publication: Improved data structures for the orthogonal range successor problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q617543)
