✦ LIBER ✦

Improving time and space efficiency in generalized binary search trees

✍ Scribed by Cunto, Walter ;Gascon, Jose Luis

Publisher: Springer-Verlag
Year: 1987
Tongue: English
Weight: 509 KB
Volume: 24
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00263296

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Space and Time Efficient Self-Stabilizin

Space and Time Efficient Self-Stabilizing ℓ-Exclusion in Tree Networks

✍ R. Hadid 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 292 KB

We propose an efficient self-stabilizing '-exclusion algorithm in rooted tree networks running under an unfair distributed daemon. The '-exclusion problem is a generalization of the mutual exclusion problem}' ð'51) processors, instead of 1, are permitted to use a shared resource. The algorithm is se

Finding all the palindromes in a binary

Finding all the palindromes in a binary tree in linear time and space

✍ Bettina De Iaco; Fabrizio Luccio 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 457 KB