✦ LIBER ✦

Bounds on algorithms for string generation

✍ Scribed by A. C. McKellar; C. K. Wong

Publisher: Springer-Verlag
Year: 1972
Tongue: English
Weight: 430 KB
Volume: 1
Category: Article
ISSN: 0001-5903
DOI: 10.1007/bf00289511

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(1) time algorithm for generating Fi

An O(1) time algorithm for generating Fibonacci strings

✍ Kenji Mikawa; Ichiro Semba 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB

A fast algorithm for bounded generalized

A fast algorithm for bounded generalized processing networks

✍ J. David Fuller; B. Lan 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 854 KB

Surface algorithms using bounds on deriv

Surface algorithms using bounds on derivatives

✍ Daniel Filip; Robert Magedson; Robert Markot 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 1016 KB

Surface algorithms using bounds on deriv

Surface algorithms using bounds on derivatives

✍ Daniel Filip; Robert Magedson; Robert Markot 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 1016 KB

This paper generalizes three very important algorithms for surfaces which previously only worked well with polynomials. The algorithms are calculation of piecewise linear approximations, min-max boxes, and surface/surface intersections. The class of surfaces that can be handled are all parametric C

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

On circle generation algorithms

✍ Won L. Chung 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 165 KB

Criteria for comparing circle generation algorithms are presented, and au algorithm opeimal with regard to these criteria is described.