Priority Search Trees
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Region-restricted clustering for geographic data mining
- Fast dynamic intersection searching in a set of isothetic line segments
- Zooming by repeated range detection
- A practical divide-and-conquer algorithm for the rectangle intersection problem
- Computing on a free tree via complexity-preserving mappings
- Fractional cascading. I: A data structuring technique
- Fractional cascading. II: Applications
- A log log n data structure for three-sided range queries
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
- On the equivalence of some rectangle problems
- The parenthesis tree
- On the dynamic maintenance of maximal points in the plane
- Dynamic output-sensitive hidden surface removal for c-oriented polyhedra
- On the optimal binary plane partition for sets of isothetic rectangles
- Efficient labelling algorithms for the maximum noncrossing matching problem
- Linear-time construction of treaps and Cartesian trees
- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- Indexing moving points
- Simple algorithms for the on-line multidimensional dictionary and related problems
- Optimal deterministic shallow cuttings for 3-d dominance ranges
- A new framework for addressing temporal range queries and some preliminary results
- A deterministic skip list for \(k\)-dimensional range search
- Sorting signed permutations by reversals, revisited
- A dynamic fixed windowing problem
- Updating a balanced search tree in 0(1) rotations
- Efficient minimum spanning tree construction with Delaynay triangulation
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
- Randomized search trees
- An in-place min-max priority search tree
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph
- Persistent homology in \(\ell_\infty\) metric
- Cutting bamboo down to size
- Computing the longest common almost-increasing subsequence
- Window queries for intersecting objects, maximal points and approximations using coresets
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- Compressing dictionary matching index via sparsification technique
- Computing rectangle enclosures
- Arboral satisfaction: recognition and LP approximation
- Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time
- Space efficient dynamic orthogonal range reporting
- On the difficulty of range searching.
- Multistage online maxmin allocation of indivisible entities
- scientific article; zbMATH DE number 1670652 (Why is no real title available?)
- Succinct and Implicit Data Structures for Computational Geometry
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- Data structures for range-aggregation over categories
- Sparse dominance queries for many points in optimal time and space
- Efficient range searching for categorical and plain data
- Time-optimal top-k document retrieval
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Priority Range Trees
- Range-Aggregate Queries Involving Geometric Aggregation Operations
- Time windowed data structures for graphs
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Efficient non-intersection queries on aggregated geometric data
- The L∞ Hausdorff Voronoi Diagram Revisited
- External memory orthogonal range reporting with fast updates
- Ranking intervals under visibility constraints∗
- New Upper Bounds on Continuous Tree Edge-Partition Problem
- Dynamic ordered sets with exponential search trees
- Dynamic rectangular intersection with priorities
- New Data Structures for IP Lookup and Conflict Detection
- New Data Structures for Orthogonal Range Queries
- The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
- Data Structures for Retrieval on Square Grids
- scientific article; zbMATH DE number 4060691 (Why is no real title available?)
- Deferred Data Structuring
- The density maximization problem in graphs
- Dynamic Trees and Dynamic Point Location
- Visibility of rectagular objects inL1metric
- On random cartesian trees
- Efficient algorithms for centers and medians in interval and circular-arc graphs
- Efficient splitting and merging algorithms for order decomposable problems
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
- scientific article; zbMATH DE number 742984 (Why is no real title available?)
- scientific article; zbMATH DE number 827974 (Why is no real title available?)
- Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments
- How to update a balanced binary tree with a constant number of rotations
- Dynamic partition trees
- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
- On the difficulty of range searching
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
- The Most Likely Object to be Seen Through a Window
- Searching in dynamic tree-like partial orders
- Cache-oblivious range reporting with optimal queries requires superlinear space
- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
- I/O-efficient data structures for colored range and prefix reporting
- Linear space data structures for two types of range search
- scientific article; zbMATH DE number 7649972 (Why is no real title available?)
- UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
- UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
- Dynamic interval index structure in constraint database systems
- scientific article; zbMATH DE number 7760488 (Why is no real title available?)
- Minimum dominating sets of intervals on lines
- Complexity and approximation for discriminating and identifying code problems in geometric setups
- Optimal window queries on line segments using the trapezoidal search DAG
This page was built for publication: Priority Search Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3678686)
