Decomposable searching problems
From MaRDI portal
Publication:1256856
DOI10.1016/0020-0190(79)90117-0zbMath0404.68067OpenAlexW2060978628WikidataQ56763501 ScholiaQ56763501MaRDI QIDQ1256856
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://figshare.com/articles/journal_contribution/Decomposable_searching_problems_/6604676
Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Discrete mathematics in relation to computer science (68R99)
Related Items
Rooted Uniform Monotone Minimum Spanning Trees ⋮ I/O-efficient dynamic planar point location ⋮ A technique for adding range restrictions to generalized searching problems ⋮ Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors ⋮ An algorithm to compute bounds for the star discrepancy ⋮ On the difficulty of range searching ⋮ Lagrangian particle method for compressible fluid dynamics ⋮ Static and dynamic algorithms for k-point clustering problems ⋮ The range 1 query (R1Q) problem ⋮ On estimating the complexity of logarithmic decomposition ⋮ Space Efficient Multi-dimensional Range Reporting ⋮ General methods for adding range restrictions to decomposable searching problems ⋮ Maintaining range trees in secondary memory. Part I: Partitions ⋮ Maintaining range trees is secondary memory. Part II: Lower bounds ⋮ Efficient splitting and merging algorithms for order decomposable problems ⋮ A series of algorithmic results related to the iterated hairpin completion ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Concatenable segment trees ⋮ Geometric Applications of Posets ⋮ On Prefix/Suffix-Square Free Words ⋮ An optimal algorithm for \(L_1\) shortest paths in unit-disk graphs ⋮ Range updates and range sum queries on multidimensional points with monoid weights ⋮ Dynamic convex hulls under window-sliding updates ⋮ Reasoning about visibility ⋮ Some principles for dynamizing decomposable searching problems ⋮ Two general methods for dynamizing decomposable searching problems ⋮ Data Structures for Data-Intensive Applications: Tradeoffs and Design Guidelines ⋮ General methods for 'all elements' and 'all pairs' problems ⋮ Balancing graph Voronoi diagrams with one more vertex ⋮ Worst-case optimal insertion and deletion methods for decomposable searching problems ⋮ Optimal dynamization of decomposable searching problems ⋮ Dynamic fractional cascading ⋮ Maintenance of configurations in the plane ⋮ Online recognition of dictionary with one gap ⋮ Near-optimal algorithms for shortest paths in weighted unit-disk graphs ⋮ Using persistent data structures for adding range restrictions to searching problems ⋮ Divided \(k-d\) trees ⋮ Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures ⋮ An optimal time and minimal space algorithm for rectangle intersection problems ⋮ Efficient partition trees ⋮ On space efficient two dimensional range minimum data structures ⋮ On the difficulty of range searching. ⋮ Dynamic partition trees ⋮ A limit field for orthogonal range searches in two-dimensional random point search trees ⋮ Maintaining multiple representations of dynamic data structures ⋮ Cache-oblivious R-trees ⋮ On the power of multiple anonymous messages: frequency estimation and selection in the shuffle model of differential privacy ⋮ Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs. ⋮ A New Lower Bound for Semigroup Orthogonal Range Searching ⋮ Geometric applications of posets ⋮ Data structures in real-time environment ⋮ An application of $m$-ary trees to the design of data structures for geometric searching problems ⋮ Compact and succinct data structures for multidimensional orthogonal range searching ⋮ A data structure for dynamic range queries ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Efficient maximum matching algorithms for trapezoid graphs ⋮ Lower bounds on the efficiency of transforming static data structures into dynamic structures ⋮ Efficient splitting and merging algorithms for order decomposable problems. ⋮ Dynamic partition trees ⋮ Fast dynamic intersection searching in a set of isothetic line segments ⋮ Fast Diameter Computation within Split Graphs
