James Allen Fill

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Robert P. Dobrow

> Home > Persons > James Allen Fill

Publications

2003
[j14]
- view
  authority control:
- export record
  dblp key:
  - journals/rsa/DobrowF03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/DobrowF03
Robert P. Dobrow, James Allen Fill:
Speeding up the FMMR perfect sampling algorithm: A case study revisited. Random Struct. Algorithms 23(4): 434-452 (2003)
1999
[j8]
- view
  - electronic edition @ cambridge.org
  - no references & citations available
- export record
  dblp key:
  - journals/cpc/DobrowF99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/DobrowF99
Robert P. Dobrow, James Allen Fill:
Total Path Length For Random Recursive Trees. Comb. Probab. Comput. 8(4): 317-333 (1999)
1997
[j7]
- view
  - electronic edition @ cambridge.org
  - no references & citations available
- 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)
1996
[j6]
- view
  authority control:
- export record
  dblp key:
  - journals/cpc/DobrowF96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cpc/DobrowF96
Robert P. Dobrow, James Allen Fill:
Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. Comb. Probab. Comput. 5: 351-371 (1996)

a service of

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.