A unifying look at data structures

Authors:
Jean Vuillemin
Affiliations:
Univ. of Paris-South, Orsay, France
Venue:
Communications of the ACM
Year:
1980

Citing 4
Cited 52

The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A new representation for linear lists

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
A representation for linear lists with movable fingers

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Efficient implementation of the first-fit strategy for dynamic storage allocation

ACM Transactions on Programming Languages and Systems (TOPLAS)
Highly parallelizable problems

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel construction of trees with optimal weighted path length

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Optimal parallel string algorithms: sorting, merging and computing the minimum

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
All Nearest Smaller Values on the Hypercube

IEEE Transactions on Parallel and Distributed Systems
Distance problems in computational geometry with fixed orientations

SCG '85 Proceedings of the first annual symposium on Computational geometry
A simple implementation technique for priority search queues

Proceedings of the sixth ACM SIGPLAN international conference on Functional programming
Nearest common ancestors: a survey and a new distributed algorithm

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
An asymptotic theory for Cauchy---Euler differential equations with applications to the analysis of algorithms

Journal of Algorithms - Analysis of algorithms
Orthogonal Range Queries in OLAP

ICDT '01 Proceedings of the 8th International Conference on Database Theory
2-D Spatial Indexing Scheme in Optimal Time

ADBIS-DASFAA '00 Proceedings of the East-European Conference on Advances in Databases and Information Systems Held Jointly with International Conference on Database Systems for Advanced Applications: Current Issues in Databases and Information Systems
Constructing Tournament Representations: An Exercise in Pointwise Relational Programming

MPC '02 Proceedings of the 6th International Conference on Mathematics of Program Construction
Dynamic orthogonal range queries in OLAP

Theoretical Computer Science - Database theory
Scalability of dynamic storage allocation algorithms

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Scaling and related techniques for geometry problems

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Lyndon words, permutations and trees

Theoretical Computer Science - WORDS
Undo facilities for the extended z-buffer in NC machining simulation

Computers in Industry
Reductions in binary search trees

Theoretical Computer Science
Maintaining stream statistics over multiscale sliding windows

ACM Transactions on Database Systems (TODS)
A new framework for addressing temporal range queries and some preliminary results

Theoretical Computer Science
On the range maximum-sum segment query problem

Discrete Applied Mathematics
Binary Search Trees, Recurrent Properties andWave Equations

Fundamenta Informaticae
A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings

Information Processing Letters
Multipartite priority queues

ACM Transactions on Algorithms (TALG)
Inversion-sensitive sorting algorithms in practice
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles

ACM Transactions on Algorithms (TALG)
An embedded declarative data transformation language

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
Online Sorted Range Reporting

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Linear-time construction of suffix arrays

CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
An efficient parallel algorithm for building the separating tree

Journal of Parallel and Distributed Computing
Data structures for range minimum queries in multidimensional arrays

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
On space efficient two dimensional range minimum data structures

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Secure authenticated comparisons

ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Path minima queries in dynamic weighted trees

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays

SIAM Journal on Computing
Amortized rigidness in dynamic cartesian trees

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Theoretical and practical improvements on the RMQ-Problem, with applications to LCA and LCE

CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Optimal succinctness for range minimum queries

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
On the range maximum-sum segment query problem

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Techniques for indexing and querying temporal observations for a collection of objects

ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
An empirical study for inversions-sensitive sorting algorithms

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Minimizing setup and beam-on times in radiation therapy

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Two constant-factor-optimal realizations of adaptive heapsort

IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Rank-Sensitive data structures

SPIRE'05 Proceedings of the 12th international conference on String Processing and Information Retrieval
Encoding 2d range maximum queries

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
The weak-heap data structure: Variants and applications

Journal of Discrete Algorithms
Binary Search Trees, Recurrent Properties andWave Equations

Fundamenta Informaticae
Adaptive Tuple differential coding

DEXA'07 Proceedings of the 18th international conference on Database and Expert Systems Applications
Efficient external memory structures for range-aggregate queries

Computational Geometry: Theory and Applications
Two dimensional range minimum queries and fibonacci lattices

ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Faster and smaller inverted indices with treaps

Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval
Spaces, Trees, and Colors: The algorithmic landscape of document retrieval on sequences

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	48.22

Visualization

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.