✦ LIBER ✦

New Results for Self-Similar Trees with Applications to River Networks

✍ Scribed by Peckham, Scott D.

Book ID: 119692478
Publisher: American Geophysical Union
Year: 1995
Tongue: English
Weight: 663 KB
Volume: 31
Category: Article
ISSN: 0043-1397
DOI: 10.1029/94wr03155

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Point process models for self-similar ne

Point process models for self-similar network traffic, with applications

✍ Ryu, Bo; Steven, B. Lowen 📂 Article 📅 1998 🏛 Informa UK (Taylor & Francis) 🌐 English ⚖ 988 KB

Energy and buffer aware application mapp

Energy and buffer aware application mapping for networks-on-chip with self similar traffic

✍ Çelik, Coşkun; Bazlamaçcı, Cüneyt F. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 839 KB

Amortization Results for Chromatic Searc

Amortization Results for Chromatic Search Trees, with an Application to Priority Queues

✍ Joan Boyar; Rolf Fagerberg; Kim S Larsen 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 396 KB

The intention in designing data structures with relaxed balance, such as chromatic search trees, is to facilitate fast updating on shared-memory asynchronous parallel architectures. To obtain this, the updating and rebalancing have been uncoupled, so extensive locking in connection with updates is a

Fixed set theory for closed corresponden

Fixed set theory for closed correspondences with applications to self-similarity and games

✍ Efe A Ok 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Approximations for the Random Minimal Sp

Approximations for the Random Minimal Spanning Tree with Application to Network Provisioning

✍ Anjani Jain and John W. Mamer 📂 Article 📅 1988 🏛 INFORMS 🌐 English ⚖ 345 KB

Some New Results for McKean’s Graphs wit

Some New Results for McKean’s Graphs with Applications to Kac’s Equation

✍ Ester Gabetta; Eugenio Regazzini 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 339 KB