Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An efficient algorithm for cyclic reference counting.

From MaRDI portal
Publication:1853056
Jump to:navigation, search

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.

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1853056&oldid=14237068"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki