𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A randomized embedding algorithm for trees

✍ Scribed by Benny Sudakov; Jan Vondrák

Book ID
106167749
Publisher
Springer-Verlag
Year
2010
Tongue
English
Weight
335 KB
Volume
30
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A de-embedding algorithm for electromagn
A de-embedding algorithm for electromagnetics
✍ Rautio, James C. 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 503 KB

A "double delay" de-embedding algorithm appropriate for electromagnetic analyses is described. This algorithm uses only two standards, a through and a double length through. By evaluating these standards, a special class of port discontinuities may be characterized and removed from the data calculat

A distributed algorithm for embedding tr
A distributed algorithm for embedding trees in hypercubes with modifications for run-time fault tolerance
✍ Foster J. Provost; Rami Melhem 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 588 KB

In this paper we present a distributed algorithm for embedding binary trees in hypercubes. Starting with the root (invoked in some cube node by a host), each node is responsible for determining the addresses of its children, and for invoking the embedding algorithm for the subtree rooted at each chi