An ALGOL-based associative language
Communications of the ACM
Programming Techniques: ASP—a ring implemented associative structure package
Communications of the ACM
Compound data structure for computer aided design; a survey
ACM '67 Proceedings of the 1967 22nd national conference
Tramp: An interpretive associative processor with deductive capabilities
ACM '68 Proceedings of the 1968 23rd ACM national conference
Sketchpad: a man-machine graphical communication system
AFIPS '63 (Spring) Proceedings of the May 21-23, 1963, spring joint computer conference
A laboratory for the study of graphical man-machine communication
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
APL: a language for associative data handling in PL/I
AFIPS '66 (Fall) Proceedings of the November 7-10, 1966, fall joint computer conference
A compact data structure for storing, retrieving and manipulating line drawings
AFIPS '67 (Spring) Proceedings of the April 18-20, 1967, spring joint computer conference
Multi-function graphics for a large computer system
AFIPS '67 (Fall) Proceedings of the November 14-16, 1967, fall joint computer conference
Data structures and techniques for remote computer graphics
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Graphical systems communication: an associative memory approach
AFIPS '68 (Fall, part I) Proceedings of the December 9-11, 1968, fall joint computer conference, part I
Some problems in associative processor applications to data base management
AFIPS '74 Proceedings of the May 6-10, 1974, national computer conference and exposition
A methodology for the development of special-purpose function architectures
AFIPS '82 Proceedings of the June 7-10, 1982, national computer conference
| Hi-index | 0.00 |
The marriage of computer graphics and an associative memory is a natural union. This is evidenced by the widespread use of software simulations of associative memories in today's most flexible graphical systems. The content-addressability of a hardware associative memory makes conventional addressing schemes superfluous and eliminates the need for pointers required to link related data, vastly reducing system overhead. The parallel retrieval and update functions possible with a hardware associative memory remove any need for multiple storage which is so prevalent in current systems and simultaneously increases processing speed. The capability of implicitly storing relations between data further decreases the storage requirements, while increasing flexibility.