Zobrazeno 1 - 10
of 80
pro vyhledávání: '"James Allen Fill"'
Autor:
Patrick Bindjeme, james Allen fill
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
In a continuous-time setting, Fill (2012) proved, for a large class of probabilistic sources, that the number of symbol comparisons used by $\texttt{QuickSort}$, when centered by subtracting the mean and scaled by dividing by time, has a limiting dis
Externí odkaz:
https://doaj.org/article/b9cc41909a0d45a284d2680e285cb57b
Autor:
Patrick Bindjeme, james Allen fill
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AQ,..., Iss Proceedings (2012)
Using a recursive approach, we obtain a simple exact expression for the $L^2$-distance from the limit in the classical limit theorem of Régnier (1989) for the number of key comparisons required by $\texttt{QuickSort}$. A previous study by Fill and J
Externí odkaz:
https://doaj.org/article/63a2f5bd9d884e00a9533e27263b1d83
Autor:
james Allen fill, Nevin Kapur
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AD,..., Iss Proceedings (2005)
Using recent results on singularity analysis for Hadamard products of generating functions, we obtain the limiting distributions for additive functionals on $m$-ary search trees on $n$ keys with toll sequence $(i) n^α$ with $α ≥ 0 (α =0$ and $α
Externí odkaz:
https://doaj.org/article/85110cfaf9604dd19f2bb1ea8356a62b
Autor:
James Allen Fill, Svante Janson
Publikováno v:
Electronic Journal of Probability. 28
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84a0bae61bc08648a1ce1fb6c6f95a7e
https://doi.org/10.1214/23-ejp915
https://doi.org/10.1214/23-ejp915
Autor:
James Allen Fill, Daniel Q. Naiman
Publikováno v:
Electron. J. Probab.
For iid $d$-dimensional observations $X^{(1)}, X^{(2)}, \ldots$ with independent Exponential$(1)$ coordinates, consider the boundary (relative to the closed positive orthant), or "frontier", $F_n$ of the closed Pareto record-setting (RS) region \[ \m
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6c2012f7d2567afecaecd498edfcfd23
https://doi.org/10.1214/20-ejp492
https://doi.org/10.1214/20-ejp492
Autor:
James Allen Fill, Wei-Chun Hung
Publikováno v:
Electron. J. Probab.
We substantially refine asymptotic logarithmic upper bounds produced by Svante Janson (2015) on the right tail of the limiting QuickSort distribution function $F$ and by Fill and Hung (2018) on the right tails of the corresponding density $f$ and of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f87e11c89b08615bd237a7d3be5d49fa
https://doi.org/10.1214/19-ejp331
https://doi.org/10.1214/19-ejp331
Autor:
James Allen Fill
We establish a fundamental property of bivariate Pareto records for independent observations uniformly distributed in the unit square. We prove that the asymptotic conditional distribution of the number of records broken by an observation given that
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::16cee02ca1c2c7060f39335dcc455671
Autor:
Wei-Chun Hung, James Allen Fill
Publikováno v:
Electron. Commun. Probab.
We give upper and lower asymptotic bounds for the left tail and for the right tail of the continuous limiting QuickSort density $f$ that are nearly matching in each tail. The bounds strengthen results from a paper of Svante Janson (2015) concerning t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::84e985e574015ccd8082b3670ecc1032
https://doi.org/10.1214/19-ecp213
https://doi.org/10.1214/19-ecp213
Autor:
Mark Daniel Ward, James Allen Fill
Publikováno v:
Algorithmica. 82:385-385
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc3165cd58ae7c256d6ea6d6f8512a31
https://doi.org/10.1007/s00453-019-00668-4
https://doi.org/10.1007/s00453-019-00668-4