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. © 1980, ACM. All rights reserved.
Author supplied keywords
Cite
CITATION STYLE
APA
Vuillemin, J. (1980). A unifying look at data structures. Communications of the ACM, 23(4), 229–239. https://doi.org/10.1145/358841.358852
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free