Rotem, Doron On a correspondence between binary trees and a certain type of permutation. (English) Zbl 0323.05006 Inf. Process. Lett. 4, 58-61 (1975). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 2 ReviewsCited in 15 Documents MSC: 05A15 Exact enumeration problems, generating functions 05A05 Permutations, words, matrices 05C05 Trees × Cite Format Result Cite Review PDF Full Text: DOI References: [1] Knuth, D. E., The Art of Computer Programming, Vol. 3 (1973), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0191.17903 [2] Knuth, D. E., The Art of Computer Programming, Vol. 1 (1968), Addison-Wesley: Addison-Wesley Reading, Mass · Zbl 0191.17903 [3] Schensted, C., Longest increasing and decreasing subsequences, Canad. J. Math., 13, 179-191 (1961) · Zbl 0097.25202 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.