Representation of binary trees on associative memories

https://doi.org/10.1016/0020-0190(73)90016-1Get rights and content

First page preview

First page preview
Click to open first page preview

References (4)

  • N. Minsky

    Multi-route access on cylinder memories

    Proc. Sixth Ann. Princeton Conf. of Inform. Sciences and Systems

    (1972)
  • N. Minsky

    Rotating storage devices as partially associative memories

    Proc. FJCC

    (1972)
There are more references available in the full text version of this article.

Cited by (3)

  • FPGA acceleration of semantic tree reasoning algorithms

    2015, Journal of Systems Architecture
    Citation Excerpt :

    Relationships between nodes are translated into table entries, qualified by the relationship type and the direction of such relation (i.e. A-node or B-node using Scone terminology). Fig. 5 graphically represents the method [25] that computes the parents or children of a given node, as explained below. In the RHC, the Semantic Tree CAM (STC) stores the flat representation as described above.

Technical Report 72-14.

View full text