SIGN IN
SIGN UP
Compact Storage of Binary Trees
Full Text:
Pdf
Buy this Article
Author:
Paolo Sipala
Istituto di elettrotecnica e di elettronica, Università degli Studi di Trieste, Via Valerio, 10, 34127 Trieste, Italy
Published in:
· Journal
ACM Transactions on Programming Languages and Systems (TOPLAS)
TOPLAS Homepage
archive
Volume 4 Issue 3, July 1982
Pages 345-361
ACM
New York, NY
, USA
table of contents
doi>
10.1145/357172.357174
1982 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 5
· Downloads (cumulative): 361
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
data types and structures
design
languages
linked representations
lisp
performance
theory
trees
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder