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