New upper bounds for generalized intersection searching problems
From MaRDI portal
Publication:4645201
DOI10.1007/3-540-60084-1_97zbMATH Open1412.68287OpenAlexW1502823945MaRDI QIDQ4645201FDOQ4645201
Authors: Panayiotis Bozanis, Nectarios Kitsios, Christos Makris, Athanasios K. Tsakalidis 
Publication date: 10 January 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-60084-1_97
Recommendations
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Publication:4934236
- Algorithms for generalized halfspace range searching and other intersection searching problems
- Lower bounds for intersection searching and fractional cascading in higher dimension
Cites Work
- Optimal Search in Planar Subdivisions
- An optimal algorithm for intersecting line segments in the plane
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Adding range restriction capability to dynamic data structures
- Making data structures persistent
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- A Functional Approach to Data Structures and Its Use in Multidimensional Searching
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric retrieval problems
- Point retrieval for polygons
Cited In (15)
- Colored range queries and document retrieval
- Point enclosure problem for homothetic polygons
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Colored top-\(K\) range-aggregate queries
- GENERALIZED INTERSECTION SEARCHING PROBLEMS
- Cross-document pattern matching
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- Title not available (Why is that?)
- I/O-optimal categorical 3-sided skyline queries
- Succinct Color Searching in One Dimension
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines
- Time Windowed Data Structures for Graphs
- WCET free time analysis of hard real-time systems on multiprocessors: A regular language-based model
- Lower bounds for set intersection queries
- Querying relational event graphs using colored range searching data structures
This page was built for publication: New upper bounds for generalized intersection searching problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645201)
