Efficiency of a Binary Comparison Storage Technique

DOI10.1145/321832.321836zbMATH Open0282.68008OpenAlexW2112500154MaRDI QIDQ4768614FDOQ4768614

Morteza Amir Rahimi, R. W. Robinson, Edgar M. Palmer

Publication date: 1974

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321832.321836

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Information storage and retrieval of data (68P20) Exact enumeration problems, generating functions (05A15)

Cited In (2)

• Randomly balanced binary trees
• Title not available (Why is that?)

This page was built for publication: Efficiency of a Binary Comparison Storage Technique

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