Compact Storage of Binary Trees
From MaRDI portal
Publication:3943988
DOI10.1145/357172.357174zbMath0484.68013OpenAlexW2048754970MaRDI QIDQ3943988
Publication date: 1982
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357172.357174
programming languagesstatistical modeltree structurecompact encodingbehavior of LISP programsdistribution of data structuresexpected storage cost of a representation of binary treesk-pointer cellsLISP treeslist structure regularitythree-pointer nodes
This page was built for publication: Compact Storage of Binary Trees