Skip to Main Content
An ideal match of a computational data structure and a topology happens once the structure is directly mapped into a physical layout. Nanotechnologies offer various topological structures in spatial dimensions. One of the problems arising from this variety is to "delegate" computing properties to these structures. A direct approach is to embed the data structure into a given topology. Decision trees (DTs) and diagrams (DDs) are candidate data structures with the ability to compute an arbitrary switching and multivalued functions. In this paper, we manipulate the topology of DTs and DDs in the iterative embedding process using the property of topological flexibility. We report our experimental results on application of algebraic (Spolynomials, after Stankovi´c) and graphical (Voronoi diagrams) structures to design and evaluate various topologies.