A note on growing binary trees (Q2555859): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Donald J. Newman / rank | |||
Property / author | |||
Property / author: Donald J. Newman / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Two inequalities implied by unique decipherability / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:53, 12 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on growing binary trees |
scientific article |
Statements
A note on growing binary trees (English)
0 references
1973
0 references