The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

James Allen Fill: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. James Allen Fill, Mark Huber
    The Randomness Recycler: A New Technique for Perfect Sampling. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:503-511 [Conf]
  2. James Allen Fill, Svante Janson
    The number of bit comparisons used by Quicksort: an average-case analysis. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:300-307 [Conf]
  3. James Allen Fill
    An Interruptible Algorithm for Perfect Sampling via Markov Chains. [Citation Graph (0, 0)][DBLP]
    STOC, 1997, pp:688-695 [Conf]
  4. James Allen Fill, Svante Janson
    Smoothness and decay properties of the limiting Quicksort density function [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  5. James Allen Fill, Svante Janson
    A characterization of the set of fixed points of the Quicksort transformation [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  6. Luc Devroye, James Allen Fill, Ralph Neininger
    Perfect simulation from the Quicksort limit distribution [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  7. Robert P. Dobrow, James Allen Fill
    Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:351-371 [Journal]
  8. Persi Diaconis, James Allen Fill, Jim Pitman
    Analysis of Top To Random Shuffles. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1992, v:1, n:, pp:135-155 [Journal]
  9. Robert P. Dobrow, James Allen Fill
    Total Path Length For Random Recursive Trees. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:4, pp:- [Journal]
  10. James Allen Fill, Robert P. Dobrow
    The Number of m-ary Search Trees on n Keys. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:4, pp:435-453 [Journal]
  11. James Allen Fill, Svante Janson
    Quicksort asymptotics. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:1, pp:4-28 [Journal]
  12. Robert P. Dobrow, James Allen Fill
    Speeding up the FMMR perfect sampling algorithm: A case study revisited. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2003, v:23, n:4, pp:434-452 [Journal]
  13. James Allen Fill
    On the distribution of binary search trees under the random permutation model. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:8, n:1, pp:1-25 [Journal]
  14. James Allen Fill, Lars Holst
    On the distribution of search cost for the move-to-front rule. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:8, n:3, pp:179-186 [Journal]
  15. James Allen Fill, Svante Janson
    Approximating the limiting Quicksort distribution. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:3-4, pp:376-406 [Journal]
  16. James Allen Fill, Nevin Kapur
    Transfer theorems and asymptotic distributional results for m-ary search trees. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2005, v:26, n:4, pp:359-391 [Journal]
  17. James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal
    Extension of Fill's perfect rejection sampling algorithm to general chains. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:17, n:3-4, pp:290-316 [Journal]
  18. James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen
    Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2000, v:16, n:2, pp:156-176 [Journal]
  19. James Allen Fill
    The Radon Transform on Zn. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1989, v:2, n:2, pp:262-283 [Journal]
  20. James Allen Fill
    Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:185-206 [Journal]
  21. James Allen Fill, Nevin Kapur
    Limiting distributions for additive functionals on Catalan trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:326, n:1-3, pp:69-102 [Journal]
  22. James Allen Fill, Nevin Kapur, Alois Panholzer
    Destruction of Very Simple Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:3-4, pp:345-366 [Journal]

  23. The Number of Symbol Comparisons in QuickSort and QuickSelect. [Citation Graph (, )][DBLP]


Search in 0.040secs, Finished in 0.041secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002