A programming language
Fast Search Algorithms for Associative Memories
IEEE Transactions on Computers
APL '89 Conference proceedings on APL as a tool of thought
APL '91 Proceedings of the international conference on APL '91
A bibliography of APL articles on modeling and KBES
ACM SIGAPL APL Quote Quad
A hardware implementation of gridless routing based on content addressable memory
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Bit-Parallel Arithmetic in a Massively-Parallel Associative Processor
IEEE Transactions on Computers
Programming notation in systems design
IBM Systems Journal
Use of Multiwrite for General Programmability of Search Memories
Journal of the ACM (JACM)
Associative Processor Architecture—a Survey
ACM Computing Surveys (CSUR)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information science in a Ph.D. computer science program
Communications of the ACM
A simple proof of Lewin's ordered-retrieval theorem for associative memories
Communications of the ACM
ACM SIGAPL APL Quote Quad
ACM SIGAPL APL Quote Quad
Implementing Associative Search and Responder Resolution
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Syntactic experiments with arrays of functions and operators
APL '84 Proceedings of the international conference on APL
Function assignment and arrays of functions
APL '84 Proceedings of the international conference on APL
Is APL epidemic? or a study of its growth through an extended bibliography
APL '72 Proceedings of the fourth international conference on APL
ACM SIGPLAN Notices - Special issue: History of programming languages conference
A study of the utility of associative memory processors
ACM '66 Proceedings of the 1966 21st national conference
Formal description of processes—the first step in design automation
DAC '65 Proceedings of the SHARE design automation project
MASCOTS '96 Proceedings of the 4th International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Investigation of some hardware accelerators for relational algebra operations
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 14 - Volume 15
History of programming languages I
Unified Interval Classification and Unified 3-Classification for Associative Memories
IEEE Transactions on Computers
A common language for hardware, software, and applications
AFIPS '62 (Fall) Proceedings of the December 4-6, 1962, fall joint computer conference
Associative memory system implementation and characteristics
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
IEEE Transactions on Computers
A Search Memory for Many-to-Many Comparisons
IEEE Transactions on Computers
An intrinsically addressed processing system
IBM Systems Journal
Programming notation in systems design
IBM Systems Journal
A formal description of SYSTEM/360
IBM Systems Journal
IBM Journal of Research and Development
Journal of Parallel and Distributed Computing
Performance analysis in a 4096 processor environment
Journal of Systems and Software
A Simple Implementation of Dijkstra's Shortest Path Algorithm on Associative Parallel Processors
Fundamenta Informaticae
A gentle introduction to the associative computing (ASC) model of parallel computation
Journal of Computing Sciences in Colleges
| Hi-index | 0.05 |
The underlying logical structure of parallel-search memories is described; the characteristic operation of three major types is displayed in the execution of searches based on equality; and algorithms are presented for searches based on other specifications including maximum, miniTnum, greater than, less than, nearest to, between limits, and ordering (sorting). It is shown that there is a hierarchy of dependency among these algorithms, that they appear in pairs with each member of a pair belonging to one or the other of two distinct classes, and that every type of search can be executed within each class.