✦ LIBER ✦

Comparison of lower bounds to the lengths of deterministic multiprocessor schedules

✍ Scribed by A. I. Kuksa

Publisher: Springer US
Year: 1980
Tongue: English
Weight: 475 KB
Volume: 15
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01071221

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computation of a lower bound of the leng

Computation of a lower bound of the lengths of schedules

✍ T. A. Tushkina 📂 Article 📅 1985 🏛 Springer US 🌐 English ⚖ 284 KB

Comparison of certain methods of computi

Comparison of certain methods of computing the lower bounds of shortest schedules

✍ Yu. P. Laptin 📂 Article 📅 1978 🏛 Springer US 🌐 English ⚖ 368 KB

A lower bound on the period length of a

A lower bound on the period length of a distributed scheduler

✍ Yossi Malka; Shlomo Moran; Shmuel Zaks 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 886 KB

Lower bounds on the lengths of node sequ

Lower bounds on the lengths of node sequences in directed graphs

✍ George Markowsky; Robert Endre Tarjan 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 353 KB

A strong node sequence for a directed graph G = (N, A) is a sequence of nodes containing every cycle-free path of G as a subsequence. A weak node sequence for G is a sequence of nodes containing every basic path in G as a subsequence, where a basic path nt, n~ ..... nj, is a path from Ilt to nk such

Upper and lower bounds for the lengths o

Upper and lower bounds for the lengths of non-propagating cracks

✍ A.D. Cameron; R.A. Smith 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 517 KB

Tight lower bounds on the length of word

Tight lower bounds on the length of word chains

✍ Ingo Althöfer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 113 KB