×

Encoding search trees in lists. (English) Zbl 0481.68030


MSC:

68P05 Data structures
68P10 Searching and sorting
68R10 Graph theory (including graph drawing) in computer science
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Demillo R. A., Communications of the ACM 21 pp 288– (1978) · Zbl 0378.68014
[2] Rosenberg A. L., Acta Informatica 9 pp 273– (1978) · Zbl 0434.68048
[3] Rosenberg A. L., Journal of the ACM 26 pp 668– (1979) · Zbl 0423.68003
[4] Rosenberg A. L., Theoretical Computer Science 11 pp 145– (1980) · Zbl 0423.68028
[5] Rosenberg A. L., Mathematical Systems Theory 12 pp 9– (1978) · Zbl 0403.68018
[6] Rosenberg A. L., Mathematical Systems Theory 13 pp 105– (1979) · Zbl 0437.68013
[7] Sheidvasser M. A., Problemy Kibernetica 29 pp 63– (1974)
[8] Vaishnavi V. K., The optimal encoding of search trees in single forward reference lists · Zbl 0481.68030
[9] Wood D., BIT 18 pp 219– (1978) · Zbl 0386.68018
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.