Traversing Binary Tree Structures with Shift-Register Memories

Authors:
W. E. Kluge
Affiliations:
Gesellschaft für Mathematik und Datenverarbeitung mbH Bonn
Venue:
IEEE Transactions on Computers
Year:
1977

Citing 5
Cited 2

Reduction languages for reduction machines

ISCA '75 Proceedings of the 2nd annual symposium on Computer architecture
Dynamic Memories with Rapid Random and Sequential Access

IEEE Transactions on Computers
A Computing Machine Based on Tree Structures

IEEE Transactions on Computers
The Anticipatory Control of a Cyclically Permutable Memory

IEEE Transactions on Computers
Dynamic Memories with Enhanced Data Access

IEEE Transactions on Computers

Tree Search in Major/Minor Loop Magnetic Bubble Memories

IEEE Transactions on Computers
A Tree Storage Scheme for Magnetic Bubble Memories

IEEE Transactions on Computers

Quantified Score

Hi-index	14.99

Visualization

Abstract

The paper proposes a tree-structured shift-register memory which employs two different data permutation operations to perform pre-/post-order traversals of binary tree structures.