An efficient algorithm for cyclic reference counting.

DOI10.1016/S0020-0190(01)00328-3zbMath1044.68705MaRDI QIDQ1853056

Rafael Dueire Lins

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Garbage collectionMemory managementCyclic graphsReference counting

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

An efficient approach to cyclic reference counting based on a coarse-grained search ⋮ Cyclic reference counting

Uses Software

• Haskell
• Miranda

Cites Work

• Unnamed Item
• Unnamed Item
• Cyclic reference counting with local mark-scan
• Cyclic reference counting with lazy mark-scan
• Generational cyclic reference counting

This page was built for publication: An efficient algorithm for cyclic reference counting.