Home → Magazine Archive → April 1980 (Vol. 23, No. 4) → A unifying look at data structures → Abstract

A unifying look at data structures

By Jean Vuillemin

Communications of the ACM, Vol. 23 No. 4, Pages 229-239
10.1145/358841.358852


Save PDF
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.

The full text of this article is premium content

0 Comments

No entries found