✦ LIBER ✦

Lower bounds on the loading of multiple bus networks for binary tree algorithms

✍ Scribed by Dharmasena, H.P.; Vaidyanathan, R.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New lower bounds on the cost of binary s

✍ Roberte De Prisco; Alfredo De Santis 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 674 KB

Lower Bound for the Linear Multiple Pack

✍ Volodia Blinovsky 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 103 KB

We obtain the asymptotic lower bound for the rate of fixed size multiple packing.

Lower Bounds on Streaming Algorithms for

✍ Gál, Anna; Gopalan, Parikshit 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 256 KB

Upper and Lower Bounds on the Makespan o

✍ K. Kalpakis; Y. Yesha 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 322 KB

On lower bounds for the complexity of po

✍ W. Baur; K. Halupczok 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 207 KB

An exponential lower bound on the size o

✍ D. Grigoriev; M. Karpinski; A.C. Yao 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 335 KB