Priority Search Trees
From MaRDI portal
Publication:3678686
DOI10.1137/0214021zbMATH Open0564.68050OpenAlexW2142753649MaRDI QIDQ3678686FDOQ3678686
Authors: Edward M. McCreight 
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ce684914d2ee4c870db16a2edc2dbceca4c2ad2c
Recommendations
Cited In (only showing first 100 items - show all)
- Dynamic Trees and Dynamic Point Location
- On random cartesian trees
- Dynamic ordered sets with exponential search trees
- On the dynamic maintenance of maximal points in the plane
- Hidden surface removal for rectangles
- Sorting signed permutations by reversals, revisited
- \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm
- New Upper Bounds on Continuous Tree Edge-Partition Problem
- Title not available (Why is that?)
- A practical divide-and-conquer algorithm for the rectangle intersection problem
- The parenthesis tree
- Efficient dynamic algorithms for some geometric intersection problems
- Storing line segments in partition trees
- Fast local searches and updates in bounded universes
- Linear-time construction of treaps and Cartesian trees
- A log log n data structure for three-sided range queries
- Fractional cascading. I: A data structuring technique
- The optimal representation of disjoint iso-oriented rectangles in two-dimensional trees
- Multidimensional heaps and complementary range searching
- Computing on a free tree via complexity-preserving mappings
- Randomized search trees
- A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
- A dynamic fixed windowing problem
- On the difficulty of range searching
- Indexing moving points
- Fair on-line scheduling of a dynamic set of tasks on a single resource
- Dynamic rectangular intersection with priorities
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- Compressing dictionary matching index via sparsification technique
- A general approach for cache-oblivious range reporting and approximate range counting
- Sparse dominance queries for many points in optimal time and space
- I/O-efficient data structures for colored range and prefix reporting
- Time-optimal top-\(k\) document retrieval
- Region-restricted clustering for geographic data mining
- Linear space data structures for two types of range search
- Simple algorithms for the on-line multidimensional dictionary and related problems
- Efficient splitting and merging algorithms for order decomposable problems
- Binary search trees of almost optimal height
- New Data Structures for Orthogonal Range Queries
- Further results on generalized intersection searching problems: Counting, reporting, and dynamization
- Title not available (Why is that?)
- Computing the longest common almost-increasing subsequence
- 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
- Cache-oblivious range reporting with optimal queries requires superlinear space
- Tight(er) worst-case bounds on dynamic searching and priority queues
- Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths
- Title not available (Why is that?)
- Efficient non-intersection queries on aggregated geometric data
- FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
- Dynamic partition trees
- Updating a balanced search tree in 0(1) rotations
- Efficient minimum spanning tree construction with Delaynay triangulation
- Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra
- Faster algorithms for computing longest common increasing subsequences
- Deferred Data Structuring
- Data Structures for Retrieval on Square Grids
- Zooming by repeated range detection
- 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
- Title not available (Why is that?)
- On the equivalence of some rectangle problems
- The density maximization problem in graphs
- The L∞ Hausdorff Voronoi Diagram Revisited
- Matching points with rectangles and squares
- Efficient algorithms for centers and medians in interval and circular-arc graphs
- Dynamic 3-sided planar range queries with expected doubly-logarithmic time
- Visibility of rectagular objects inL1metric
- Priority Range Trees
- Building a parallel branch and bound library
- Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity
- Efficient range searching for categorical and plain data
- Querying Relational Event Graphs Using Colored Range Searching Data Structures
- Space efficient dynamic orthogonal range reporting
- New Data Structures for IP Lookup and Conflict Detection
- Data structures for range-aggregation over categories
- Window queries for intersecting objects, maximal points and approximations using coresets
- Title not available (Why is that?)
- Ranking intervals under visibility constraints∗
- Sum-of-local-effects data structures for separable graphs
- Computing rectangle enclosures
- Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching
- Optimal deterministic shallow cuttings for 3-d dominance ranges
- Optimal window queries on line segments using the trapezoidal search DAG
- Parallel data distribution management on shared-memory multiprocessors
- Searching in dynamic tree-like partial orders
- Time windowed data structures for graphs
- Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
- 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
- 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
- UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
- UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES
- Title not available (Why is that?)
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)
