Priority Search Trees
From MaRDI portal
Publication:3678686
DOI10.1137/0214021zbMath0564.68050OpenAlexW2142753649MaRDI QIDQ3678686
Publication date: 1985
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/ce684914d2ee4c870db16a2edc2dbceca4c2ad2c
Related Items
Computing rectangle enclosures, Fair on-line scheduling of a dynamic set of tasks on a single resource, Linear-time construction of treaps and Cartesian trees, Sparse dominance queries for many points in optimal time and space, The L∞ Hausdorff Voronoi Diagram Revisited, Efficient algorithms for centers and medians in interval and circular-arc graphs, Connecting the maximum number of grid nodes to the boundary with non-intersecting line segments, Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity, How to update a balanced binary tree with a constant number of rotations, On the difficulty of range searching, Zooming by repeated range detection, A practical divide-and-conquer algorithm for the rectangle intersection problem, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, Computing on a free tree via complexity-preserving mappings, DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES, Further results on generalized intersection searching problems: Counting, reporting, and dynamization, Fractional cascading. II: Applications, EXTERNAL MEMORY ORTHOGONAL RANGE REPORTING WITH FAST UPDATES, On random cartesian trees, A log log n data structure for three-sided range queries, Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees, A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency, Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals, Computing the longest common almost-increasing subsequence, Ranking intervals under visibility constraints∗, Randomized search trees, Efficient range searching for categorical and plain data, The density maximization problem in graphs, Multistage online maxmin allocation of indivisible entities, Indexing moving points, Complexity and approximation for discriminating and identifying code problems in geometric setups, New Upper Bounds on Continuous Tree Edge-Partition Problem, Optimal window queries on line segments using the trapezoidal search DAG, Unnamed Item, Time-Optimal Top-$k$ Document Retrieval, Querying Relational Event Graphs Using Colored Range Searching Data Structures, Binary search trees of almost optimal height, Storing line segments in partition trees, Dynamic 3-sided planar range queries with expected doubly-logarithmic time, Unnamed Item, Hidden surface removal for rectangles, Efficient dynamic algorithms for some geometric intersection problems, On the equivalence of some rectangle problems, The parenthesis tree, Faster algorithms for computing longest common increasing subsequences, Weight-constrained and density-constrained paths in a tree: enumerating, counting, and \(k\)-maximum density paths, Data Structures for One-Dimensional Packet Classification Using Most-Specific-Rule Matching, Data structures for extension violations in a query range, On the dynamic maintenance of maximal points in the plane, Space efficient dynamic orthogonal range reporting, Stabbing segments with rectilinear objects, The Most Likely Object to be Seen Through a Window, Window queries for intersecting objects, maximal points and approximations using coresets, Dynamic output-sensitive hidden surface removal for \(c\)-oriented polyhedra, Minimum dominating sets of intervals on lines, Matching points with rectangles and squares, FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING, Optimal deterministic shallow cuttings for 3-d dominance ranges, Fast local searches and updates in bounded universes, On the difficulty of range searching., Maximum weighted matching with few edge crossings for 2-layered bipartite graph, On the optimal binary plane partition for sets of isothetic rectangles, Cache-oblivious range reporting with optimal queries requires superlinear space, Dynamic interval index structure in constraint database systems, Dynamic partition trees, 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, Linear space data structures for two types of range search, Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity, A general approach for cache-oblivious range reporting and approximate range counting, Region-restricted clustering for geographic data mining, Range-Aggregate Queries Involving Geometric Aggregation Operations, New Data Structures for IP Lookup and Conflict Detection, Persistent homology in \(\ell_\infty\) metric, UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES, UPDATE-EFFICIENT DATA STRUCTURES FOR DYNAMIC IP ROUTER TABLES, Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems, A dynamic fixed windowing problem, EFFICIENT NON-INTERSECTION QUERIES ON AGGREGATED GEOMETRIC DATA, Cutting bamboo down to size, Dynamic Trees and Dynamic Point Location, Updating a balanced search tree in 0(1) rotations, Succinct and Implicit Data Structures for Computational Geometry, Time Windowed Data Structures for Graphs, Efficient minimum spanning tree construction with Delaynay triangulation, Unnamed Item, \textsc{OnlineMin}: a fast strongly competitive randomized paging algorithm, Dynamic partition trees, Visibility of rectagular objects inL1metric, Fast dynamic intersection searching in a set of isothetic line segments, Efficient labelling algorithms for the maximum noncrossing matching problem, Compressing dictionary matching index via sparsification technique
