✦ LIBER ✦

On the area of binary tree layouts

✍ Scribed by R.P. Brent; H.T. Kung

Book ID: 113162198
Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 349 KB
Volume: 11
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(80)90034-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

VLSI layout of binary tree structures

✍ P. Chuavalee; L.N. Bhuyan 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 791 KB

On the area of hypercube layouts

✍ Ronald I. Greenberg; Lee Guan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 106 KB

This paper precisely analyzes the wire density and required area in standard layout styles for the hypercube. It shows that the most natural, regular layout of a hypercube of N 2 nodes in the plane, in an N × N grid arrangement, uses 2N/3 + 1 horizontal wiring tracks for each row of nodes. (In the p

Optimal three-dimensional layouts of com

Optimal three-dimensional layouts of complete binary trees

✍ Ajay K. Gupta; Susanne E. Hambrusch 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 731 KB

On the maximum edge length in VLSI layou

On the maximum edge length in VLSI layouts of complete binary trees

✍ Hartmut Schmeck 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 328 KB

Efficient algorithms for realizing a lay

Efficient algorithms for realizing a layout of complete binary trees

✍ Yumi Fukushima; Yoshihide Igarashi 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 606 KB

A lower bound on the area of permutation

A lower bound on the area of permutation layouts

✍ Alok Aggarwal; Maria Klawe; David Lichtenstein; Nathan Linial; Avi Wigderson 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 846 KB