✦ LIBER ✦

On the space requirement of interval routing

✍ Scribed by Tse, S.S.H.; Lau, F.C.M.

Book ID: 119773008
Publisher: IEEE
Year: 1999
Tongue: English
Weight: 153 KB
Volume: 48
Category: Article
ISSN: 0018-9340
DOI: 10.1109/12.780884

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Compactness of Interval Routing

✍ Gavoille, Cyril; Peleg, David 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 338 KB

On the storage space requirement of cons

On the storage space requirement of consecutive retrieval with redundancy

✍ H.-D. Ehrich; W. Lipski Jr. 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 653 KB

Reducing the space requirement of suffix

Reducing the space requirement of suffix trees

✍ Stefan Kurtz 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 202 KB

We show that suffix trees store various kinds of redundant information. We exploit these redundancies to obtain more space efficient representations. The most space efficient of our representations requires 20 bytes per input character in the worst case, and 10.1 bytes per input character on average

The Compactness of Interval Routing for

The Compactness of Interval Routing for Almost All Graphs

✍ Gavoille, Cyril; Peleg, David 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 202 KB

On starshapedness in products of interva

On starshapedness in products of interval spaces

✍ Victor Chepoi 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 330 KB

Hilbert space as the space of retraction

Hilbert space as the space of retractions of an interval

✍ V. N. Basmanov; A. G. Savchenko 📂 Article 📅 1987 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 305 KB