✦ LIBER ✦

An O(n log n) feasibility algorithm for preemptive scheduling of n independent jobs on a hypercube

✍ Scribed by Mohan Ahuja; Yahui Zhu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n-log-log-n) Time Algorithm for Con

✍ T. Asano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 601 KB

An O(log n) parallel algorithm for const

✍ Wang Yue-Li; Chen Hon-Chan; Lee Chen-Yu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 396 KB

An O (n · log(n)) algorithm to compute t

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 106 KB

An O (k · n)-time algorithm for computin

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 105 KB

An O(k3·log(nk)) algorithm for the conse

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 116 KB

An O(kn) algorithm for a circular consec

📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 115 KB