A unifying look at data structures

1980/04/01 by Jean Vuillemin · 284 citations
Mathematics · Computer Science · #Advanced Combinatorial Mathematics #Algorithms and Data Compression #Data Management and Algorithms #Simple (philosophy) #Computer science #Data structure #Theoretical computer science #Algorithm #Programming language

paper · pdf · doi:10.1145/358841.358852

published in Communications of the ACM 23(4), 229-239 (Association for Computing Machinery)

openalex publication_date 1980/04/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/25

Abstract

Examples of fruitful interaction between geometrical combinatorics and the design and analysis of algorithms are presented. A demonstration is given of the way in which a simple geometrical construction yields new and efficient algorithms for various searching and list manipulation problems.

Citations

• Applications of a Planar Separator Theorem
• A data structure for orthogonal range queries
• Multidimensional binary search trees used for associative searching

Cited by

• All nearest smaller values on the hypercube
• All nearest smaller values [wikipedia]
• Cartesian tree [wikipedia]