A unifying look at data structures
From MaRDI portal
Publication:3873557
DOI10.1145/358841.358852zbMath0434.68047OpenAlexW2103913570WikidataQ60204380 ScholiaQ60204380MaRDI QIDQ3873557
Publication date: 1980
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/358841.358852
Graph theory (including graph drawing) in computer science (68R10) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25) Discrete mathematics in relation to computer science (68R99)
Related Items
New algorithms for the LCA problem and the binary tree reconstruction problem, Succinct indices for path minimum, with applications, On succinct representations of binary trees, Reductions in binary search trees, Linear-time construction of treaps and Cartesian trees, Two dimensional range minimum queries and Fibonacci lattices, Optimal Encodings for Range Top-$$k$$, Selection, and Min-Max, Linear-time heuristics for minimum weight rectangulation, Computing on a free tree via complexity-preserving mappings, On the range maximum-sum segment query problem, On random cartesian trees, Optimal Algorithms for Running Max and Min Filters on Random Inputs, Improved range minimum queries, The summed start-up costs in a unit commitment problem, Arboral satisfaction: recognition and LP approximation, Average number of messages for distributed leader-fitting in rings of processors, Randomized search trees, Parallel construction of succinct trees, Range Minimum Query Indexes in Higher Dimensions, Average number of messages for distributed leader finding in rings of processors, The weak-heap data structure: variants and applications, Encoding range minima and range top-2 queries, Encoding 2D range maximum queries, Dynamic orthogonal range queries in OLAP., Succinct permutation graphs, Finding range minima in the middle: approximations and applications, The “Runs” Theorem, Space-efficient data structure for next/previous larger/smaller value queries, Unnamed Item, Faster algorithms for largest empty rectangles and boxes, Exact average message complexity values for distributed election on bidirectional rings of processors, Finding patterns and periods in Cartesian tree matching, Permutation inversions and multidimensional cumulative distribution functions, Fast algorithms for single and multiple pattern Cartesian tree matching, Smooth Heaps and a Dual View of Self-Adjusting Data Structures, Lyndon words, permutations and trees., Building Cartesian trees from free trees with \(k\) leaves, Automatic average-case analysis of algorithms, A complexity calculus for recursive tree algorithms, An efficient parallel algorithm for building the separating tree, Secure Authenticated Comparisons, FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING, Unnamed Item, Stacks, queues, and deques with order-statistic operations, On space efficient two dimensional range minimum data structures, Shape rectangularization problems in intensity-modulated radiation therapy, Spaces, Trees, and Colors, Deletions in random binary search trees: a story of errors, A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings, A new framework for addressing temporal range queries and some preliminary results, Verified analysis of random binary tree structures, Cartesian and Lyndon trees, Fully Functional Static and Dynamic Succinct Trees, Compressed range minimum queries, Algorithms for sequential generation of combinatorial structures, An application of $m$-ary trees to the design of data structures for geometric searching problems, Unnamed Item, Orthogonal Range Searching for Text Indexing, PARALLEL RANGE MINIMA ON COARSE GRAINED MULTICOMPUTERS, Efficient maximum matching algorithms for trapezoid graphs
