"The Number of m-ary Search Trees on n Keys."

James Allen Fill, Robert P. Dobrow (1997)

> Home

Details and statistics

DOI: —

access: closed

type: Journal Article

metadata version: 2020-03-12

- view
  - electronic edition @ cambridge.org
- export record
  dblp key:
  - journals/cpc/FillD97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/FillD97
James Allen Fill, Robert P. Dobrow:
The Number of m-ary Search Trees on n Keys. Comb. Probab. Comput. 6(4): 435-453 (1997)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.