An efficient algorithm for cyclic reference counting.

DOI10.1016/S0020-0190(01)00328-3MaRDI QIDQ1853056zbMATH OpenFDO

Authors 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

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

Cites work

• scientific article; zbMATH DE number 3951980 (Why is no real title available?)
• scientific article; zbMATH DE number 1018876 (Why is no real title available?)
• Cyclic reference counting with lazy mark-scan
• Cyclic reference counting with local mark-scan
• Generational cyclic reference counting

Cited in

(2)

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

Describes a project that uses

Uses Software

• Miranda
• Haskell

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1853056)