✦ LIBER ✦

Computation on binary tree-networks

✍ Scribed by Maurice Tchuente

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 553 KB
Volume: 14
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(86)90033-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simulation of Binary Trees and X-Trees o

Simulation of Binary Trees and X-Trees on Pyramid Networks

✍ A. Dingle; I.H. Sudborough 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 425 KB

Computation of Boolean functions on netw

Computation of Boolean functions on networks of binary automata

✍ Maurice Tchuente 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 541 KB

Comments on computing the similarity of

Comments on computing the similarity of binary trees

✍ J.P. Jarvis; J.K. Luedeman; D.R. Shier 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 358 KB

On Binary Computation Structures

✍ Bernhard Heinemann 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 696 KB

## Abstract Based on a modification of Moss' and Parikh's topological modal language [8], we study a generalization of a weakly expressive fragment of a certain propositional modal logic of time. We define a bimodal logic comprising operators for __knowledge__ and __nexttime.__ These operators are

On binary search trees

✍ Roberto De Prisco; Alfredo De Santis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Indirect covering tree problems on spann

Indirect covering tree problems on spanning tree networks

✍ Vicki Aaronson Hutson; Charles ReVelle 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 722 KB