✦ LIBER ✦

An O(n) algorithm for computing the set of available expressions of D-charts

✍ Scribed by K. Taniguchi; T. Kasami

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(kN.log N) algorithm for decomposing

✍ Sukhamay Kundu; Radhakrishnan Sridhar 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 630 KB

An algorithm for computing the hull of t

✍ Jiri Rohn 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 524 KB

A new O(n·log n) algorithm for computing

✍ Sukhamay Kundu 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 441 KB

An O(log n) algorithm for computing the

✍ Friedrich J. Urbanek 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 166 KB

An O(n2) active set algorithm for the so

✍ Manuel A. Gómez 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 104 KB

An O(k2·log(n)) algorithm for computing

✍ Min-Sheng Lin 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 142 KB