#### Filter Results:

- Full text PDF available (2)

#### Publication Year

1970

2014

- This year (0)
- Last 5 years (1)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Gerald G. Brown, Bruno O. Shubert
- Math. Oper. Res.
- 1984

A widely used class of binary trees is studied in order to provide information useful in evaluating algorithms based on this storage structure. A closed form counting formula for the number of binary trees with n nodes and height k is developed and restated as a recursion more useful computationally . A generating function for the number of nodes given… (More)

- Bruno O. Shubert
- IEEE Trans. Systems, Man, and Cybernetics
- 1975

- Bruno O. Shubert, Calvin Marion Anderson
- IEEE Trans. Information Theory
- 1973

A class of finite-memory deterministic algorithms is introduced and investigated. Opt imum algorithms are found for small numbers (up to 21) of states. The algorithms provide their own stopping rules.

- Bruno O. Shubert
- IEEE Trans. Information Theory
- 1970

- Bruno O. Shubert, Jack R. Borsting, fVVhan Dele Enorod
- 2014

- Bruno O. Shubert
- IEEE Trans. Information Theory
- 1974

- ‹
- 1
- ›