A Note on Enumerating Binary Trees-Reference-Cited by-同舟云学术

A Note on Enumerating Binary Trees

Published:1980-01 Issue:1 Volume:27 Page:3-5
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Solomon Marvin¹,Finkel Raphael A.¹

Affiliation:

1. Computer Sciences Department, University of Wisconsin, 1210 West Dayton Street, Madison, WI

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference3 articles.

1. A numbering system for binary trees

2. Generation of Binary Trees from Ballot Sequences

3. KNUTH D E TheArt of Computer Programming Vol 1 FundamentalAlgorahms Addison-Wesley Reading Mass 1973 KNUTH D E TheArt of Computer Programming Vol 1 FundamentalAlgorahms Addison-Wesley Reading Mass 1973

Cited by 53 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Simple Random Sampling of Binary Forests with Fixed Number of Nodes and Trees;Lecture Notes in Computer Science;2024

2. An Efficient Scheme for the Generation of Ordered Trees in Constant Amortized Time;2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM);2021-01-04

3. Efficient Generation, Ranking, and Unranking of (k, m)-Ary Trees in B-Order;Bulletin of the Iranian Mathematical Society;2018-12-06

4. Generating strictly binary trees at random based on convex polygon triangulations;International Journal of Computer Mathematics;2015-02-03

5. CONSTANT-MEMORY ITERATIVE GENERATION OF SPECIAL STRINGS REPRESENTING BINARY TREES;International Journal of Foundations of Computer Science;2012-02