Pages that link to "Item:Q3678701"
From MaRDI portal
The following pages link to New Data Structures for Orthogonal Range Queries (Q3678701):
Displaying 43 items.
- (Approximate) uncertain skylines (Q359874) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Space-efficient data-analysis queries on grids (Q390915) (← links)
- Monge properties of sequence alignment (Q418004) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- New trie data structures which support very fast search operations (Q794438) (← links)
- Algorithms for graphs of bounded treewidth via orthogonal range searching (Q833703) (← links)
- The \(k\)-means range algorithm for personalized data clustering in e-commerce (Q857263) (← links)
- Dynamic fractional cascading (Q908708) (← links)
- Parallel general prefix computations with geometric, algebraic, and other applications (Q916378) (← links)
- Light orthogonal networks with constant geometric dilation (Q1013080) (← links)
- Approximate colored range and point enclosure queries (Q1018093) (← links)
- Optimal solutions for a class of point retrieval problems (Q1062772) (← links)
- On-line updating of solutions to a class of matroid intersection problems (Q1090461) (← links)
- The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric (Q1093374) (← links)
- Computing on a free tree via complexity-preserving mappings (Q1098314) (← links)
- Fractional cascading. II: Applications (Q1099958) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems (Q1124391) (← links)
- Polygonal intersection searching (Q1165007) (← links)
- A density control algorithm for doing insertions and deletions in a sequentially ordered file in a good worst-case time (Q1187029) (← links)
- Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors (Q1343464) (← links)
- Orthogonal queries in segments (Q1355726) (← links)
- Dynamic orthogonal range queries in OLAP. (Q1401285) (← links)
- A deterministic skip list for \(k\)-dimensional range search (Q1772103) (← links)
- Dominating the complements of bounded tolerance graphs and the complements of trapezoid graphs (Q1827836) (← links)
- A data structure for dynamic range queries (Q1838844) (← links)
- Extending range queries and nearest neighbors (Q1841241) (← links)
- Enhanced layered segment trees: a pragmatic data structure for real-time processing of geometric objects (Q1860195) (← links)
- An algorithm for handling many relational calculus queries efficiently. (Q1872707) (← links)
- Computing Shapley values in the plane (Q2118220) (← links)
- Multidimensional segment trees can do range updates in poly-logarithmic time (Q2220857) (← links)
- The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching (Q2287830) (← links)
- Minimal output unstable configurations in chemical reaction networks and deciders (Q2311221) (← links)
- Computing rectangle enclosures (Q2365809) (← links)
- Space efficient dynamic orthogonal range reporting (Q2461544) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- Range searching in multidimensional databases using navigation metadata (Q2656721) (← links)
- Of Concurrent Data Structures and Iterations (Q3464481) (← links)
- A unified approach to geometric problems using dual cone transformation: (Q4323401) (← links)
- An application of $m$-ary trees to the design of data structures for geometric searching problems (Q4730791) (← links)
- (Q5009466) (← links)
- (Q5088947) (← links)
