✦ LIBER ✦

A reduction architecture for the optimal scheduling of binary trees

✍ Scribed by K. Ravikanth; P.S. Sastry; K.R. Ramakrishnan; Y.V. Venkatesh

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 658 KB
Volume: 4
Category: Article
ISSN: 0167-739X
DOI: 10.1016/0167-739x(88)90006-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The cost of a class of optimal binary tr

The cost of a class of optimal binary trees

✍ Alan C Tucker 📂 Article 📅 1974 🏛 Elsevier Science 🌐 English ⚖ 251 KB

A note on optimal area algorithms for up

A note on optimal area algorithms for upward drawings of binary trees

✍ P. Crescenzi; G. Di Battista; A. Piperno 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 793 KB

A method for the design of binary tree c

A method for the design of binary tree classifiers

✍ Shi Qing-Yun; K.S. Fu 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 550 KB

The analysis of a fringe heuristic for b

The analysis of a fringe heuristic for binary search trees

✍ Patricio V Poblete; J.Ian Munro 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 569 KB

Simulation study on the architecture opt

Simulation study on the architecture optimization and task scheduling of a parallel flight training simulator

✍ Chuan-yuan Wen; Zheng-she Liu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 731 KB

The Characterization of Topology: A Comp

The Characterization of Topology: A Comparison of Four topological Indices for Rooted Binary Trees

✍ G.M. Berntson 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 388 KB

The quantification of the topological features of binary trees has been applied in several branches of biology, from botany to neurobiology to animal behaviour. The methods available for quantifying tree topology differ, both in how they are applied and how they relate to one another. In this paper,