A Functional Approach to Data Structures and Its Use in Multidimensional Searching

No abstract is available for this paper.

• Publication year

  1988

• Venue

  SIAM journal on computing (Print)

• Publication date

  1988-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/0217026
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Design of Dynamic Data Structures

  1987cited by this paper
• Lower bounds on the complexity of multidimensional searching

  1986cited by this paper
• Priority Search Trees

  1985cited by this paper
• New Data Structures for Orthogonal Range Queries

  1985cited by this paper
• Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract)

  1985cited by this paper
• Adding range restriction capability to dynamic data structures

  1985cited by this paper
• Fast Algorithms for Finding Nearest Common Ancestors

  1984cited by this paper
• Some methods of computational geometry applied to computer graphics

  1984cited by this paper
• Scaling and related techniques for geometry problems

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

  1983cited by this paper
• A linear-time algorithm for a special case of disjoint set union

  1983cited by this paper
• A constructive approach to the design of algorithms and their data structures

  1983cited by this paper
• On the Equivalence of Some Rectangle Problems

  1982cited by this paper
• On the Intersection of Orthogonal Objects

  1981cited by this paper
• A unifying look at data structures

  1980cited by this paper
• Functional programming: application and implementation

  1980cited by this paper
• An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles

  1980cited by this paper
• Multidimensional divide-and-conquer

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

  1979cited by this paper
• A data structure for orthogonal range queries

  1978cited by this paper
• Abstract data types and the development of data structures

  1977cited by this paper
• Location of a point in a planar subdivision and its applications

  1976cited by this paper
• The Design and Analysis of Computer Algorithms

  1974cited by this paper
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper
• Toward an understanding of data structures

  1971cited by this paper

• Quantum Data Structure for Range Minimum Query

  2026cites this paper
• Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions

  2025cites this paper
• Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index

  2025cites this paper
• Robust Learnability of Sample-Compressible Distributions under Noisy or Adversarial Perturbations

  2025cites this paper
• Faster Construction of a Planar Distance Oracle with Õ(1) Query Time

  2025cites this paper
• Efficiently Counting Triangles in Large Temporal Graphs

  2025cites this paper
• Wavelet Tree, Part I: A Brief History

  2025cites this paper
• Compact representations of pattern-avoiding permutations

  2025cites this paper
• Conjunctive Queries with Comparisons

  2025cites this paper
• R*-indexing

  2025cites this paper
• Random Sampling Over Spatial Range Joins

  2025cites this paper
• Counting Permutation Patterns with Multidimensional Trees

  2024cites this paper
• Fast and Numerically Stable Implementation of Rate Constant Matrix Contraction Method

  2024cites this paper
• String 2-Covers with No Length Restrictions

  2024cites this paper
• Efficient Privacy Preserving Range Query Using Segment Tree

  2024cites this paper
• Succinct Data Structures for Segments

  2024cites this paper
• Height-bounded Lempel-Ziv encodings

  2024cites this paper
• Counting on General Run-Length Grammars

  2024influential citation
• Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space

  2023cites this paper
• Suffix-Prefix Queries on a Dictionary

  2023influential citation
• Linear-Time Modeling of Linguistic Structure: An Order-Theoretic Perspective

  2023cites this paper
• Space-Query Tradeoffs in Range Subgraph Counting and Listing

  2023cites this paper
• Indexing for Keyword Search with Structured Constraints

  2023cites this paper
• Searching 2D-Strings for Matching Frames

  2023cites this paper
• Conjunctive Queries with Comparisons

  2023cites this paper
• Dynamic suffix array with polylogarithmic queries and updates

  2022cites this paper
• Conjunctive Queries with Comparisons

  2022cites this paper
• A data structure for substring-substring LCS length queries

  2022cites this paper
• The Fine-Grained Complexity of Multi-Dimensional Ordering Properties

  2022cites this paper
• Hierarchical Categories in Colored Searching

  2022cites this paper
• 4D Range Reporting in the Pointer Machine Model in Almost-Optimal Time

  2022cites this paper
• Space-Efficient Conversions from SLPs

  2022cites this paper
• Near-Optimal Deterministic Vertex-Failure Connectivity Oracles

  2022cites this paper
• Elastic-Degenerate String Matching with 1 Error or Mismatch

  2022cites this paper
• A comprehensive analysis of wavelet tree based indexing schemes in GIR systems

  2021cites this paper
• Discrete Fréchet Distance under Translation

  2021cites this paper
• Breaking the O(n)-Barrier in the Construction of Compressed Suffix Arrays

  2021cites this paper
• Longest Common Rollercoasters

  2021cites this paper
• Dynamic layers of maxima with applications to dominating queries

  2021cites this paper
• Beyond Equi-joins: Ranking, Enumeration and Factorization

  2021cites this paper
• Algorithms and Hardness for Multidimensional Range Updates and Queries

  2021cites this paper
• Orthogonal Range Search Data Structures

  2021cites this paper
• Box queries over multi-dimensional streams

  2021cites this paper
• Efficient tree-structured categorical retrieval

  2020cites this paper
• A reduction of the dynamic time warping distance to the longest increasing subsequence length

  2020cites this paper
• Load Plus Communication Balancing of Contiguous Sparse Matrix Partitions.

  2020influential citation
• Substring Complexity in Sublinear Space

  2020cites this paper
• Shortest paths among transient obstacles

  2020cites this paper
• Indexing Highly Repetitive String Collections, Part II

  2020influential citation
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3

  2020cites this paper
• Contiguous Graph Partitioning For Optimal Total Or Bottleneck Communication

  2020influential citation
• New Data Structures for Orthogonal Range Reporting and Range Minima Queries

  2020influential citation
• Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search

  2020cites this paper
• A Faster Reduction of the Dynamic Time Warping Distance to the Longest Increasing Subsequence Length

  2020cites this paper
• Counting 4-Patterns in Permutations Is Equivalent to Counting 4-Cycles in Graphs

  2020cites this paper
• Lecture Notes of CSCI5610 Advanced Data Structures

  2020cites this paper
• Packing R-trees with Space-filling Curves

  2020cites this paper
• Load Plus Communication Balancing in Contiguous Partitions for Distributed Sparse Matrices: Linear-Time Algorithms

  2020influential citation
• Compressed Orthogonal Search on Suffix Arrays with Applications to Range LCP.

  2020cites this paper
• A Note on a Recent Algorithm for Minimum Cut

  2020influential citation
• Four-Dimensional Dominance Range Reporting in Linear Space

  2020cites this paper
• Closest-Pair Queries and Minimum-Weight Queries are Equivalent for Squares

  2020cites this paper
• Fast Preprocessing for Optimal Orthogonal Range Reporting and Range Successor with Applications to Text Indexing

  2020cites this paper
• Sparse prefix sums: Constant-time range sum queries over sparse multidimensional data cubes

  2019cites this paper
• THAAD: Efficient Matching Queries under Temporal Abstraction for Anomaly Detection

  2019cites this paper
• Weighted min-cut: sequential, cut-query, and streaming algorithms

  2019cites this paper
• Sparse Regression via Range Counting

  2019cites this paper
• A Guide to Designing Top-k Indexes

  2019cites this paper
• Submatrix MaximumQueries in Monge Matrices are Equivalent to Predecessor Search∗

  2019cites this paper
• Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles

  2019cites this paper
• Functional Aggregate Queries with Additive Inequalities

  2018influential citation
• Faster Attractor-Based Indexes

  2018cites this paper
• Resolving SINR Queries in a Dynamic Setting

  2018cites this paper
• On Functional Aggregate Queries with Additive Inequalities

  2018influential citation
• Rectilinear Shortest Paths Among Transient Obstacles

  2018cites this paper
• Fast and Longest Rollercoasters

  2018cites this paper
• A Linear-Space Data Structure for Range-LCP Queries in Poly-Logarithmic Time

  2018cites this paper
• Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability

  2018cites this paper
• Theoretically Optimal and Empirically Efficient R-trees with Strong Parallelizability

  2018cites this paper
• Document Listing on Repetitive Collections with Guaranteed Performance 1

  2018cites this paper
• Optimal-Time Dictionary-Compressed Indexes

  2018cites this paper
• Orthogonal Point Location and Rectangle Stabbing Queries in 3-d

  2018cites this paper
• Tight Space Bounds for Two-Dimensional Approximate Range Counting

  2018cites this paper
• Computing quartet distance is equivalent to counting 4-cycles

  2018cites this paper
• Reliable Multidimensional Data Summaries Using Histograms

  2018cites this paper
• Efficiently Querying Vector and Raster Data

  2017cites this paper
• Practical Space-Efficient Data Structures for High-Dimensional Orthogonal Range Searching

  2017cites this paper
• Time-Optimal Top-k Document Retrieval

  2017cites this paper
• Data structures for analyzing geometric data

  2017influential citation
• Range-Clustering Queries

  2017cites this paper
• In-Memory Storage for Labeled Tree-Structured Data

  2017cites this paper
• Enhanced Algorithms for Compressed Pattern Matching using Wavelet Tree and Bit-parallelism

  2017cites this paper
• Sparse Prefix Sums

  2017cites this paper
• Dynamic Orthogonal Range Searching on the RAM, Revisited

  2017cites this paper
• Simplex Range Searching and Its Variants: A Review

  2017cites this paper
• Document Listing on Repetitive Collections with Guaranteed Performance

  2017cites this paper
• Text Indexing and Searching in Sublinear Time

  2017cites this paper
• Computational Fact Checking through Query Perturbations

  2017cites this paper
• A critical analysis of monitoring and evaluation systems for small and medium enterprises: With specific reference to Small and Medium Enterprises Development Agency of Nigeria (SMEDAN)

  2017cites this paper
• Two-dimensional range successor in optimal time and almost linear space

  2016cites this paper