✦ LIBER ✦

Fast algorithms for running ordering and max/min calculation

✍ Scribed by Pitas, I.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improving Gil-Werman algorithm for runni

✍ Gevorkian, D.Z.; Astola, J.T.; Atourian, S.M. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 69 KB

Power Algorithms for (max,+)- and Bipart

✍ Subiono; Jacob van der Woude 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 96 KB

First-Order Algorithms for Generalized S

✍ Elijah Polak; Liqun Qi; Defeng Sun 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 175 KB

Algorithms for Finite and Semi-Infinite

✍ E. Polak; J. O. Royset 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 229 KB

Scenario relaxation algorithm for finite

✍ Tiravat Assavapokee; Matthew J. Realff; Jane C. Ammons; I-Hsuan Hong 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 165 KB

A high-order, fast algorithm for scatter

✍ J.C. Aguilar; Yu Chen 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 994 KB