Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: James Allen Fill
@article{DBLP:journals/corr/abs-2402-17220,
author = {James Allen Fill and
Ao Sun},
title = {On the probability of a Pareto record},
journal = {CoRR},
volume = {abs/2402.17220},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.17220},
doi = {10.48550/ARXIV.2402.17220},
eprinttype = {arXiv},
eprint = {2402.17220},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-17220.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2402-17221,
author = {James Allen Fill and
Daniel Q. Naiman and
Ao Sun},
title = {Sharpened localization of the trailing point of the Pareto record
frontier},
journal = {CoRR},
volume = {abs/2402.17221},
year = {2024},
url = {https://doi.org/10.48550/arXiv.2402.17221},
doi = {10.48550/ARXIV.2402.17221},
eprinttype = {arXiv},
eprint = {2402.17221},
timestamp = {Mon, 25 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2402-17221.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/Fill21,
author = {James Allen Fill},
title = {Breaking bivariate records},
journal = {Comb. Probab. Comput.},
volume = {30},
number = {1},
pages = {105--123},
year = {2021},
url = {https://doi.org/10.1017/S0963548320000309},
doi = {10.1017/S0963548320000309},
timestamp = {Wed, 27 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/Fill21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-14749,
author = {James Allen Fill and
Wei{-}Chun Hung},
title = {Density functions for QuickQuant and QuickVal},
journal = {CoRR},
volume = {abs/2109.14749},
year = {2021},
url = {https://arxiv.org/abs/2109.14749},
eprinttype = {arXiv},
eprint = {2109.14749},
timestamp = {Mon, 04 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-14749.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FillW20,
author = {James Allen Fill and
Mark Daniel Ward},
title = {Special Issue on Analysis of Algorithms},
journal = {Algorithmica},
volume = {82},
number = {3},
pages = {385},
year = {2020},
url = {https://doi.org/10.1007/s00453-019-00668-4},
doi = {10.1007/S00453-019-00668-4},
timestamp = {Wed, 05 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/FillW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FillH19,
author = {James Allen Fill and
Wei{-}Chun Hung},
editor = {Marni Mishna and
J. Ian Munro},
title = {QuickSort: Improved right-tail asymptotics for the limiting distribution,
and large deviations (Extended Abstract)},
booktitle = {Proceedings of the Sixteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2019, San Diego, CA, USA, January 6, 2019},
pages = {87--93},
publisher = {{SIAM}},
year = {2019},
url = {https://doi.org/10.1137/1.9781611975505.9},
doi = {10.1137/1.9781611975505.9},
timestamp = {Mon, 18 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/analco/FillH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-05620,
author = {James Allen Fill and
Daniel Q. Naiman},
title = {The Pareto Record Frontier},
journal = {CoRR},
volume = {abs/1901.05620},
year = {2019},
url = {http://arxiv.org/abs/1901.05620},
eprinttype = {arXiv},
eprint = {1901.05620},
timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-05620.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-05621,
author = {James Allen Fill and
Daniel Q. Naiman},
title = {Generating Pareto records},
journal = {CoRR},
volume = {abs/1901.05621},
year = {2019},
url = {http://arxiv.org/abs/1901.05621},
eprinttype = {arXiv},
eprint = {1901.05621},
timestamp = {Sun, 03 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-05621.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1903-07775,
author = {James Allen Fill and
Wei{-}Chun Hung},
title = {QuickSort: Improved right-tail asymptotics for the limiting distribution,
and large deviations},
journal = {CoRR},
volume = {abs/1903.07775},
year = {2019},
url = {http://arxiv.org/abs/1903.07775},
eprinttype = {arXiv},
eprint = {1903.07775},
timestamp = {Tue, 02 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1903-07775.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aofa/FillH18,
author = {James Allen Fill and
Wei{-}Chun Hung},
editor = {James Allen Fill and
Mark Daniel Ward},
title = {On the Tails of the Limiting QuickSort Density},
booktitle = {29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June
25-29, 2018, Uppsala, Sweden},
series = {LIPIcs},
volume = {110},
pages = {21:1--21:10},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.AofA.2018.21},
doi = {10.4230/LIPICS.AOFA.2018.21},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/aofa/FillH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/aofa/2018,
editor = {James Allen Fill and
Mark Daniel Ward},
title = {29th International Conference on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June
25-29, 2018, Uppsala, Sweden},
series = {LIPIcs},
volume = {110},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {http://www.dagstuhl.de/dagpub/978-3-95977-078-1},
isbn = {978-3-95977-078-1},
timestamp = {Tue, 11 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/aofa/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1808-00643,
author = {James Allen Fill and
Wei{-}Chun Hung},
title = {On the tails of the limiting QuickSort density},
journal = {CoRR},
volume = {abs/1808.00643},
year = {2018},
url = {http://arxiv.org/abs/1808.00643},
eprinttype = {arXiv},
eprint = {1808.00643},
timestamp = {Sun, 02 Sep 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1808-00643.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/0001FTV16,
author = {Julien Cl{\'{e}}ment and
James Allen Fill and
Thu Hien Nguyen Thi and
Brigitte Vall{\'{e}}e},
title = {Towards a Realistic Analysis of the QuickSelect Algorithm},
journal = {Theory Comput. Syst.},
volume = {58},
number = {4},
pages = {528--578},
year = {2016},
url = {https://doi.org/10.1007/s00224-015-9633-5},
doi = {10.1007/S00224-015-9633-5},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/0001FTV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/analco/2016,
editor = {James Allen Fill and
Mark Daniel Ward},
title = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and
Combinatorics, {ANALCO} 2016, Arlington, Virginia, USA, January 11,
2016},
publisher = {{SIAM}},
year = {2016},
url = {https://doi.org/10.1137/1.9781611974324},
doi = {10.1137/1.9781611974324},
isbn = {978-1-61197-432-4},
timestamp = {Tue, 23 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/analco/2016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FillM14,
author = {James Allen Fill and
Jason Matterer},
title = {QuickSelect Tree Process Convergence, With an Application to Distributional
Convergence for the Number of Symbol Comparisons Used by Worst-Case
Find},
journal = {Comb. Probab. Comput.},
volume = {23},
number = {5},
pages = {805--828},
year = {2014},
url = {https://doi.org/10.1017/S0963548314000121},
doi = {10.1017/S0963548314000121},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FillM14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/FillJW12,
author = {James Allen Fill and
Svante Janson and
Mark Daniel Ward},
title = {Partitions with Distinct Multiplicities of Parts: On An "Unsolved
Problem" Posed By Herbert Wilf},
journal = {Electron. J. Comb.},
volume = {19},
number = {2},
pages = {18},
year = {2012},
url = {https://doi.org/10.37236/2128},
doi = {10.37236/2128},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/FillJW12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-6444,
author = {Patrick Bindjeme and
James Allen Fill},
title = {The limiting distribution for the number of symbol comparisons used
by QuickSort is nondegenerate (extended abstract)},
journal = {CoRR},
volume = {abs/1201.6444},
year = {2012},
url = {http://arxiv.org/abs/1201.6444},
eprinttype = {arXiv},
eprint = {1201.6444},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-6444.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1201-6445,
author = {Patrick Bindjeme and
James Allen Fill},
title = {Exact L{\^{}}2-distance from the limit for QuickSort key comparisons
(extended abstract)},
journal = {CoRR},
volume = {abs/1201.6445},
year = {2012},
url = {http://arxiv.org/abs/1201.6445},
eprinttype = {arXiv},
eprint = {1201.6445},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1201-6445.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2595,
author = {James Allen Fill and
Svante Janson},
title = {The number of bit comparisons used by Quicksort: an average-case analysis},
journal = {CoRR},
volume = {abs/1202.2595},
year = {2012},
url = {http://arxiv.org/abs/1202.2595},
eprinttype = {arXiv},
eprint = {1202.2595},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2595.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2599,
author = {James Allen Fill and
Tak{\'{e}}hiko Nakama},
title = {Distributional convergence for the number of symbol comparisons used
by QuickSelect},
journal = {CoRR},
volume = {abs/1202.2599},
year = {2012},
url = {http://arxiv.org/abs/1202.2599},
eprinttype = {arXiv},
eprint = {1202.2599},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2599.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1202-2601,
author = {James Allen Fill},
title = {Distributional convergence for the number of symbol comparisons used
by QuickSort},
journal = {CoRR},
volume = {abs/1202.2601},
year = {2012},
url = {http://arxiv.org/abs/1202.2601},
eprinttype = {arXiv},
eprint = {1202.2601},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1202-2601.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1203-2670,
author = {James Allen Fill and
Svante Janson and
Mark Daniel Ward},
title = {Partitions with Distinct Multiplicities of Parts: On An "Unsolved
Problem" Posed By Herbert Wilf},
journal = {CoRR},
volume = {abs/1203.2670},
year = {2012},
url = {http://arxiv.org/abs/1203.2670},
eprinttype = {arXiv},
eprint = {1203.2670},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1203-2670.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/BeerFJS11,
author = {Elizabeth Beer and
James Allen Fill and
Svante Janson and
Edward R. Scheinerman},
title = {On Vertex, Edge, and Vertex-Edge Random Graphs},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/597},
doi = {10.37236/597},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/BeerFJS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/BeerFJS11,
author = {Elizabeth Beer and
James Allen Fill and
Svante Janson and
Edward R. Scheinerman},
editor = {Philippe Flajolet and
Daniel Panario},
title = {On Vertex, Edge, and Vertex-edge Random Graphs},
booktitle = {Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2011, San Francisco, California, USA, January 22, 2011},
pages = {16--22},
publisher = {{SIAM}},
year = {2011},
url = {https://doi.org/10.1137/1.9781611973013.2},
doi = {10.1137/1.9781611973013.2},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/BeerFJS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FillN10,
author = {James Allen Fill and
Tak{\'{e}}hiko Nakama},
title = {Analysis of the Expected Number of Bit Comparisons Required by Quickselect},
journal = {Algorithmica},
volume = {58},
number = {3},
pages = {730--769},
year = {2010},
url = {https://doi.org/10.1007/s00453-009-9294-3},
doi = {10.1007/S00453-009-9294-3},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FillN10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ValleeCFF09,
author = {Brigitte Vall{\'{e}}e and
Julien Cl{\'{e}}ment and
James Allen Fill and
Philippe Flajolet},
editor = {Susanne Albers and
Alberto Marchetti{-}Spaccamela and
Yossi Matias and
Sotiris E. Nikoletseas and
Wolfgang Thomas},
title = {The Number of Symbol Comparisons in QuickSort and QuickSelect},
booktitle = {Automata, Languages and Programming, 36th International Colloquium,
{ICALP} 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {5555},
pages = {750--763},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02927-1\_62},
doi = {10.1007/978-3-642-02927-1\_62},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ValleeCFF09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/analco/FillN08,
author = {James Allen Fill and
Tak{\'{e}}hiko Nakama},
editor = {Robert Sedgewick and
Wojciech Szpankowski},
title = {Analysis of the Expected Number of Bit Comparisons Required by Quickselect},
booktitle = {Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics,
{ANALCO} 2008, San Francisco, California, USA, January 19, 2008},
pages = {249--256},
publisher = {{SIAM}},
year = {2008},
url = {https://doi.org/10.1137/1.9781611972986.9},
doi = {10.1137/1.9781611972986.9},
timestamp = {Tue, 23 May 2017 01:10:31 +0200},
biburl = {https://dblp.org/rec/conf/analco/FillN08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FillKP06,
author = {James Allen Fill and
Nevin Kapur and
Alois Panholzer},
title = {Destruction of Very Simple Trees},
journal = {Algorithmica},
volume = {46},
number = {3-4},
pages = {345--366},
year = {2006},
url = {https://doi.org/10.1007/s00453-006-0100-1},
doi = {10.1007/S00453-006-0100-1},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FillKP06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FillK05,
author = {James Allen Fill and
Nevin Kapur},
title = {Transfer theorems and asymptotic distributional results for m-ary
search trees},
journal = {Random Struct. Algorithms},
volume = {26},
number = {4},
pages = {359--391},
year = {2005},
url = {https://doi.org/10.1002/rsa.20039},
doi = {10.1002/RSA.20039},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FillK05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/FillK04,
author = {James Allen Fill and
Nevin Kapur},
title = {Limiting distributions for additive functionals on Catalan trees},
journal = {Theor. Comput. Sci.},
volume = {326},
number = {1-3},
pages = {69--102},
year = {2004},
url = {https://doi.org/10.1016/j.tcs.2004.05.010},
doi = {10.1016/J.TCS.2004.05.010},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/FillK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/FillJ04,
author = {James Allen Fill and
Svante Janson},
editor = {J. Ian Munro},
title = {The number of bit comparisons used by Quicksort: an average-case analysis},
booktitle = {Proceedings of the Fifteenth Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2004, New Orleans, Louisiana, USA, January 11-14,
2004},
pages = {300--307},
publisher = {{SIAM}},
year = {2004},
url = {http://dl.acm.org/citation.cfm?id=982792.982834},
timestamp = {Fri, 07 Dec 2012 17:02:08 +0100},
biburl = {https://dblp.org/rec/conf/soda/FillJ04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/DobrowF03,
author = {Robert P. Dobrow and
James Allen Fill},
title = {Speeding up the {FMMR} perfect sampling algorithm: {A} case study
revisited},
journal = {Random Struct. Algorithms},
volume = {23},
number = {4},
pages = {434--452},
year = {2003},
url = {https://doi.org/10.1002/rsa.10096},
doi = {10.1002/RSA.10096},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/DobrowF03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jal/FillJ02,
author = {James Allen Fill and
Svante Janson},
title = {Quicksort asymptotics},
journal = {J. Algorithms},
volume = {44},
number = {1},
pages = {4--28},
year = {2002},
url = {https://doi.org/10.1016/S0196-6774(02)00216-X},
doi = {10.1016/S0196-6774(02)00216-X},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jal/FillJ02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FillJ01,
author = {James Allen Fill and
Svante Janson},
title = {Approximating the limiting Quicksort distribution},
journal = {Random Struct. Algorithms},
volume = {19},
number = {3-4},
pages = {376--406},
year = {2001},
url = {https://doi.org/10.1002/rsa.10007},
doi = {10.1002/RSA.10007},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FillJ01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FillSS00,
author = {James Allen Fill and
Edward R. Scheinerman and
Karen B. Singer{-}Cohen},
title = {Random intersection graphs when m=omega(n): An equivalence theorem
relating the evolution of the G(n, m, p) and G(n, p) models},
journal = {Random Struct. Algorithms},
volume = {16},
number = {2},
pages = {156--176},
year = {2000},
url = {https://doi.org/10.1002/(SICI)1098-2418(200003)16:2\&\#60;156::AID-RSA3\&\#62;3.0.CO;2-H},
doi = {10.1002/(SICI)1098-2418(200003)16:2\&\#60;156::AID-RSA3\&\#62;3.0.CO;2-H},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FillSS00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FillMMR00,
author = {James Allen Fill and
Motoya Machida and
Duncan J. Murdoch and
Jeffrey S. Rosenthal},
title = {Extension of Fill's perfect rejection sampling algorithm to general
chains},
journal = {Random Struct. Algorithms},
volume = {17},
number = {3-4},
pages = {290--316},
year = {2000},
url = {https://doi.org/10.1002/1098-2418(200010/12)17:3/4\&\#60;290::AID-RSA6\&\#62;3.0.CO;2-Q},
doi = {10.1002/1098-2418(200010/12)17:3/4\&\#60;290::AID-RSA6\&\#62;3.0.CO;2-Q},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FillMMR00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siammax/FillF00,
author = {James Allen Fill and
Donniell E. Fishkind},
title = {The Moore-Penrose Generalized Inverse for Sums of Matrices},
journal = {{SIAM} J. Matrix Anal. Appl.},
volume = {21},
number = {2},
pages = {629--635},
year = {2000},
url = {https://doi.org/10.1137/S0895479897329692},
doi = {10.1137/S0895479897329692},
timestamp = {Tue, 26 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siammax/FillF00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/FillH00,
author = {James Allen Fill and
Mark Huber},
title = {The Randomness Recycler: {A} New Technique for Perfect Sampling},
booktitle = {41st Annual Symposium on Foundations of Computer Science, {FOCS} 2000,
12-14 November 2000, Redondo Beach, California, {USA}},
pages = {503--511},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/SFCS.2000.892138},
doi = {10.1109/SFCS.2000.892138},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/FillH00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-PR-0005235,
author = {James Allen Fill and
Svante Janson},
title = {Smoothness and decay properties of the limiting Quicksort density
function},
journal = {CoRR},
volume = {math.PR/0005235},
year = {2000},
url = {https://arxiv.org/abs/math/0005235},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-PR-0005235.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-PR-0005236,
author = {James Allen Fill and
Svante Janson},
title = {A characterization of the set of fixed points of the Quicksort transformation},
journal = {CoRR},
volume = {math.PR/0005236},
year = {2000},
url = {https://arxiv.org/abs/math/0005236},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-PR-0005236.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/math-PR-0005237,
author = {Luc Devroye and
James Allen Fill and
Ralph Neininger},
title = {Perfect simulation from the Quicksort limit distribution},
journal = {CoRR},
volume = {math.PR/0005237},
year = {2000},
url = {https://arxiv.org/abs/math/0005237},
timestamp = {Fri, 10 Jan 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/math-PR-0005237.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DobrowF99,
author = {Robert P. Dobrow and
James Allen Fill},
title = {Total Path Length For Random Recursive Trees},
journal = {Comb. Probab. Comput.},
volume = {8},
number = {4},
pages = {317--333},
year = {1999},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46709},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DobrowF99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/FillD97,
author = {James Allen Fill and
Robert P. Dobrow},
title = {The Number of m-ary Search Trees on n Keys},
journal = {Comb. Probab. Comput.},
volume = {6},
number = {4},
pages = {435--453},
year = {1997},
url = {http://journals.cambridge.org/action/displayAbstract?aid=46543},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/FillD97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/Fill97,
author = {James Allen Fill},
editor = {Frank Thomson Leighton and
Peter W. Shor},
title = {An Interruptible Algorithm for Perfect Sampling via Markov Chains},
booktitle = {Proceedings of the Twenty-Ninth Annual {ACM} Symposium on the Theory
of Computing, El Paso, Texas, USA, May 4-6, 1997},
pages = {688--695},
publisher = {{ACM}},
year = {1997},
url = {https://doi.org/10.1145/258533.258664},
doi = {10.1145/258533.258664},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/Fill97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DobrowF96,
author = {Robert P. Dobrow and
James Allen Fill},
title = {Multiway trees of Maximum and Minimum Probability under the Random
Permutation Model},
journal = {Comb. Probab. Comput.},
volume = {5},
pages = {351--371},
year = {1996},
url = {https://doi.org/10.1017/S096354830000211X},
doi = {10.1017/S096354830000211X},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cpc/DobrowF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/Fill96,
author = {James Allen Fill},
title = {On the distribution of binary search trees under the random permutation
model},
journal = {Random Struct. Algorithms},
volume = {8},
number = {1},
pages = {1--25},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1098-2418(199601)8:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-1},
doi = {10.1002/(SICI)1098-2418(199601)8:1\&\#60;1::AID-RSA1\&\#62;3.0.CO;2-1},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/Fill96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/rsa/FillH96,
author = {James Allen Fill and
Lars Holst},
title = {On the distribution of search cost for the move-to-front rule},
journal = {Random Struct. Algorithms},
volume = {8},
number = {3},
pages = {179--186},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1098-2418(199605)8:3\&\#60;179::AID-RSA2\&\#62;3.0.CO;2-V},
doi = {10.1002/(SICI)1098-2418(199605)8:3\&\#60;179::AID-RSA2\&\#62;3.0.CO;2-V},
timestamp = {Fri, 26 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/rsa/FillH96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Fill96,
author = {James Allen Fill},
title = {Limits and Rates of Convergence for the Distribution of Search Cost
Under the Move-to-Front Rule},
journal = {Theor. Comput. Sci.},
volume = {164},
number = {1{\&}2},
pages = {185--206},
year = {1996},
url = {https://doi.org/10.1016/0304-3975(95)00210-3},
doi = {10.1016/0304-3975(95)00210-3},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Fill96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cpc/DiaconisFP92,
author = {Persi Diaconis and
James Allen Fill and
Jim Pitman},
title = {Analysis of Top To Random Shuffles},
journal = {Comb. Probab. Comput.},
volume = {1},
pages = {135--155},
year = {1992},
url = {https://doi.org/10.1017/S0963548300000158},
doi = {10.1017/S0963548300000158},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cpc/DiaconisFP92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/Fill89,
author = {James Allen Fill},
title = {The Radon Transform on Z\({}_{\mbox{n}}\)},
journal = {{SIAM} J. Discret. Math.},
volume = {2},
number = {2},
pages = {262--283},
year = {1989},
url = {https://doi.org/10.1137/0402023},
doi = {10.1137/0402023},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/Fill89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2024-03-26 21:43 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
