✦ LIBER ✦

Two nonlinear lower bounds for on-line computations

✍ Scribed by Pavol Dūrī; Zvi Galil; Wolfgang Paul; Ruediger Reischuk

Book ID: 114037691
Publisher: Elsevier Science
Year: 1984
Weight: 495 KB
Volume: 60
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80019-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for on-line two-dimensional

Lower bounds for on-line two-dimensional packing algorithms

✍ Donna J. Brown; Brenda S. Baker; Howard P. Katseff 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 663 KB

Lower bounds for on-line graph coloring

✍ Magnus M. Halldórsson; Mario Szegedy 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Lower bounds for line stabbing

✍ D. Avis; J.M. Robert; R. Wenger 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 721 KB

Lower bounds for on-line single-machine

Lower bounds for on-line single-machine scheduling

✍ Leah Epstein; Rob van Stee 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 158 KB

Lower Bounds on the Depth of Monotone Ar

Lower Bounds on the Depth of Monotone Arithmetic Computations

✍ Don Coppersmith; Baruch Schieber 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 128 KB

dedicated to zvi galil's 50th birthday Consider an arithmetic expression of length n involving only the operations [+, \_] and non-negative constants. We prove lower bounds on the depth of any binary computation tree over the same sets of operations and constants that computes such an expression. We

On lower bounds for the nonlinear filter

On lower bounds for the nonlinear filtering problem (Corresp.)

✍ Bobrovsky, B.-Z.; Zakai, M. 📂 Article 📅 1981 🏛 IEEE 🌐 English ⚖ 275 KB