✦ LIBER ✦

On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem

✍ Scribed by Blum, Norbert

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the single-operation wo

✍ Norbert Blum; Henning Rochow 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 317 KB

Complexity of multilinear problems in th

✍ Tomasz Jackowski 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 892 KB

A complement to Tarjan's result about th

✍ Lech Banachowski 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 815 KB

Complexity of the decidability of one cl

✍ M. Tetruashvili 📂 Article 📅 1996 🏛 Walter de Gruyter GmbH & Co. KG 🌐 English ⚖ 232 KB

A theorem on inverses of convex sets of

✍ Brayton, R.; Hoffman, A.; Scott, T. 📂 Article 📅 1977 🏛 IEEE ⚖ 700 KB

On the worst-case performance of some he

✍ Marius M. Solomon 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB