Pages that link to "Item:Q3474276"
From MaRDI portal
The following pages link to Lower bounds for orthogonal range searching: I. The reporting case (Q3474276):
Displaying 40 items.
- Enabling high-dimensional range queries using \(k\)NN indexing techniques: approaches and empirical results (Q346495) (← links)
- Approximate covering detection among content-based subscriptions using space filling curves (Q362593) (← links)
- Entropy-bounded representation of point grids (Q390358) (← links)
- Reasoning about visibility (Q420853) (← links)
- How hard is half-space range searching? (Q685178) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- I/O-efficient 2-d orthogonal range skyline and attrition priority queues (Q827322) (← links)
- Optimal external memory planar point enclosure (Q834582) (← links)
- On the minimum total length of interval systems expressing all intervals, and range-restricted queries (Q1000921) (← links)
- Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines (Q1041794) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- The range 1 query (R1Q) problem (Q1659997) (← links)
- A new framework for addressing temporal range queries and some preliminary results (Q1770382) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Simplex range reporting on a pointer machine (Q1917035) (← links)
- Top tree compression of tries (Q2067669) (← links)
- Finding pairwise intersections of rectangles in a query rectangle (Q2175440) (← links)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching (Q2287830) (← links)
- Geometric BWT: compressed text indexing via sparse suffixes and range searching (Q2346957) (← links)
- On position restricted substring searching in succinct space (Q2376796) (← links)
- On the difficulty of range searching. (Q2482904) (← links)
- Range searching in multidimensional databases using navigation metadata (Q2656721) (← links)
- Orthogonal Range Searching for Text Indexing (Q2848980) (← links)
- Indexes for Document Retrieval with Relevance (Q2848984) (← links)
- Improved pointer machine and I/O lower bounds for simplex range reporting and related problems (Q2875643) (← links)
- OPTIMAL RANGE MAX DATACUBE FOR FIXED DIMENSIONS (Q4667924) (← links)
- (Q5009466) (← links)
- Fast Diameter Computation within Split Graphs (Q5024674) (← links)
- On the difficulty of range searching (Q5057458) (← links)
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ<sup>3</sup> (Q5108270) (← links)
- Permuting and Batched Geometric Lower Bounds in the I/O Model (Q5111685) (← links)
- (Q5136281) (← links)
- Lower bounds on the complexity of simplex range reporting on a pointer machine (Q5204338) (← links)
- Ranked Document Retrieval in External Memory (Q6051931) (← links)
- On semialgebraic range reporting (Q6145667) (← links)
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions (Q6159411) (← links)
- Coloring lines and Delaunay graphs with respect to boxes (Q6201036) (← links)
