An optimal dynamic interval stabbing-max data structure?

No abstract is available for this paper.

• Publication year

  2005

• Venue

  ACM-SIAM Symposium on Discrete Algorithms

• Publication date

  2005-01-23

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Optimal External Memory Interval Management

  2003cited by this paper
• I/O-Efficient Structures for Orthogonal Range-Max and Stabbing-Max Queries

  2003cited by this paper
• Fully-dynamic two dimensional orthogonal range and line segment intersection reporting in logarithmic time

  2003cited by this paper
• Dynamic rectangular intersection with priorities

  2003cited by this paper
• Data structures for one-dimensional packet classification using most-specific-rule matching

  2002cited by this paper
• I/O-efficient dynamic planar point location (extended abstract)

  2000cited by this paper
• On two-dimensional indexability and optimal range search indexing

  1999cited by this paper
• The Randomized Complexity of Maintaining the Minimum

  1996cited by this paper
• Dynamic fractional cascading

  1990cited by this paper
• The input/output complexity of sorting and related problems

  1988cited by this paper
• Filtering search: A new approach to query-answering

  1983cited by this paper
• A new approach to rectangle intersections part I

  1983cited by this paper
• A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets

  1979cited by this paper
• Noname manuscript No. (will be inserted by the editor) Incremental Computation and Maintenance of Temporal Aggregates �

  year unknowncited by this paper

• The Contiguous Art Gallery Problem is in Θ(n log n)

  2025cites this paper
• Top-k Range Search on Weighted Interval Data

  2025cites this paper
• Independent Range Sampling on Interval Data

  2024cites this paper
• Efficient Algorithms for Top-k Stabbing Queries on Weighted Interval Data (Full Version)

  2024cites this paper
• Shortest paths among transient obstacles

  2020cites this paper
• Computational Geometry: Generalized (or Colored) Intersection Searching

  2018cites this paper
• A Sorted-Partitioning Approach to Fast and Scalable Dynamic Packet Classification

  2018cites this paper
• Rectilinear Shortest Paths Among Transient Obstacles

  2018cites this paper
• Point Location in Incremental Planar Subdivisions

  2018cites this paper
• Efficiently answer top-k queries on typed intervals

  2017cites this paper
• Efficient Queries of Stand-off Annotations for Natural Language Processing on Electronic Medical Records

  2016influential citation
• Approximate Range Counting Revisited

  2015cites this paper
• Supporting Scalable Data Analytics on Large Linked Data

  2013cites this paper
• Optimal splitters for temporal and multi-version databases

  2013cites this paper
• An Optimal Dynamic Data Structure for Stabbing-Semigroup Queries

  2012cites this paper
• New results on two-dimensional orthogonal range aggregation in external memory

  2011cites this paper
• A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time

  2011influential citation
• Clustering lines in high-dimensional space: Classification of incomplete data

  2010cites this paper
• Searching in Dynamic Catalogs on a Tree

  2010cites this paper
• Clustering Lines in High Dimensional Space : Classification of Incomplete Data

  2009influential citation
• Ranked Queries in Index Data Structures

  2008cites this paper
• Algorithms and Data Structures for External Memory

  2008cites this paper
• I/O Efficient Dynamic Data Structures for Longest Prefix Queries

  2008cites this paper
• I/O-Efficient Point Location in a Set of Rectangles

  2008cites this paper
• Polygonal Chain Simplification with Small Angle Constraints

  2008cites this paper
• Optimal dynamic vertical ray shooting in rectilinear planar subdivisions

  2007cites this paper
• Combining Orthogonal Range Search and Line Simplification Using Priority Search Trees

  2005influential citation