✦ LIBER ✦

An efficient algorithm for cyclic reference counting

✍ Scribed by Rafael Dueire Lins

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 108 KB
Volume: 83
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(01)00328-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A shared memory architecture for paralle

A shared memory architecture for parallel cyclic reference counting

✍ Rafael D. Lins 📂 Article 📅 1991 🏛 Elsevier Science ⚖ 629 KB

An efficient algorithm for fast O(N∗ln(N

An efficient algorithm for fast O(N∗ln(N)) box counting

✍ Xin-Jun Hou; Robert Gilmore; Gabriel B. Mindlin; Hernán G. Solari 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 258 KB

An optimal algorithm for counting networ

An optimal algorithm for counting network motifs

✍ Royi Itzhack; Yelena Mogilevski; Yoram Louzoun 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 1001 KB

A multi-processor shared memory architec

A multi-processor shared memory architecture for parallel cyclic reference counting

✍ Rafael D. Lius 📂 Article 📅 1992 🏛 Elsevier Science ⚖ 265 KB

An efficient algorithm for multi-hoist c

An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times

✍ Janny M.Y. Leung; Eugene Levner 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 223 KB

New results from an algorithm for counti

New results from an algorithm for counting posets

✍ Joseph C. Culberson; Gregory J. E. Rawlins 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 805 KB

In this paper we report on the success of a new technique for computing the number of unlabeled partial orders on n elements based on the partial order of partial orders ordered by containment. In addition to the number of partial orders, we obtain complete enumerations of the number of partial orde