default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames Allen Fill
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c9]James Allen Fill, Daniel Q. Naiman, Ao Sun:
Sharpened Localization of the Trailing Point of the Pareto Record Frontier. AofA 2024: 28:1-28:21- [i16]James Allen Fill, Ao Sun:
On the probability of a Pareto record. CoRR abs/2402.17220 (2024) - [i15]James Allen Fill, Daniel Q. Naiman, Ao Sun:
Sharpened localization of the trailing point of the Pareto record frontier. CoRR abs/2402.17221 (2024) - 2021
- [j24]James Allen Fill:
Breaking bivariate records. Comb. Probab. Comput. 30(1): 105-123 (2021) - [i14]James Allen Fill, Wei-Chun Hung:
Density functions for QuickQuant and QuickVal. CoRR abs/2109.14749 (2021) - 2020
- [j23]James Allen Fill, Mark Daniel Ward:
Special Issue on Analysis of Algorithms. Algorithmica 82(3): 385 (2020)
2010 – 2019
- 2019
- [c8]James Allen Fill, Wei-Chun Hung:
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract). ANALCO 2019: 87-93 - [i13]James Allen Fill, Daniel Q. Naiman:
The Pareto Record Frontier. CoRR abs/1901.05620 (2019) - [i12]James Allen Fill, Daniel Q. Naiman:
Generating Pareto records. CoRR abs/1901.05621 (2019) - [i11]James Allen Fill, Wei-Chun Hung:
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations. CoRR abs/1903.07775 (2019) - 2018
- [c7]James Allen Fill, Wei-Chun Hung:
On the Tails of the Limiting QuickSort Density. AofA 2018: 21:1-21:10 - [e2]James Allen Fill, Mark Daniel Ward:
29th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, AofA 2018, June 25-29, 2018, Uppsala, Sweden. LIPIcs 110, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-078-1 [contents] - [i10]James Allen Fill, Wei-Chun Hung:
On the tails of the limiting QuickSort density. CoRR abs/1808.00643 (2018) - 2016
- [j22]Julien Clément
, James Allen Fill, Thu Hien Nguyen Thi, Brigitte Vallée:
Towards a Realistic Analysis of the QuickSelect Algorithm. Theory Comput. Syst. 58(4): 528-578 (2016) - [e1]James Allen Fill, Mark Daniel Ward:
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016. SIAM 2016, ISBN 978-1-61197-432-4 [contents] - 2014
- [j21]James Allen Fill, Jason Matterer:
QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find. Comb. Probab. Comput. 23(5): 805-828 (2014) - 2012
- [j20]James Allen Fill, Svante Janson, Mark Daniel Ward:
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. Electron. J. Comb. 19(2): 18 (2012) - [i9]Patrick Bindjeme, James Allen Fill:
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract). CoRR abs/1201.6444 (2012) - [i8]Patrick Bindjeme, James Allen Fill:
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract). CoRR abs/1201.6445 (2012) - [i7]James Allen Fill, Svante Janson:
The number of bit comparisons used by Quicksort: an average-case analysis. CoRR abs/1202.2595 (2012) - [i6]James Allen Fill, Takéhiko Nakama:
Distributional convergence for the number of symbol comparisons used by QuickSelect. CoRR abs/1202.2599 (2012) - [i5]James Allen Fill:
Distributional convergence for the number of symbol comparisons used by QuickSort. CoRR abs/1202.2601 (2012) - [i4]James Allen Fill, Svante Janson, Mark Daniel Ward:
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. CoRR abs/1203.2670 (2012) - 2011
- [j19]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman:
On Vertex, Edge, and Vertex-Edge Random Graphs. Electron. J. Comb. 18(1) (2011) - [c6]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman:
On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO 2011: 16-22 - 2010
- [j18]James Allen Fill, Takéhiko Nakama:
Analysis of the Expected Number of Bit Comparisons Required by Quickselect. Algorithmica 58(3): 730-769 (2010)
2000 – 2009
- 2009
- [c5]Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet:
The Number of Symbol Comparisons in QuickSort and QuickSelect. ICALP (1) 2009: 750-763 - 2008
- [c4]James Allen Fill, Takéhiko Nakama:
Analysis of the Expected Number of Bit Comparisons Required by Quickselect. ANALCO 2008: 249-256 - 2006
- [j17]James Allen Fill, Nevin Kapur, Alois Panholzer:
Destruction of Very Simple Trees. Algorithmica 46(3-4): 345-366 (2006) - 2005
- [j16]James Allen Fill, Nevin Kapur:
Transfer theorems and asymptotic distributional results for m-ary search trees. Random Struct. Algorithms 26(4): 359-391 (2005) - 2004
- [j15]James Allen Fill, Nevin Kapur:
Limiting distributions for additive functionals on Catalan trees. Theor. Comput. Sci. 326(1-3): 69-102 (2004) - [c3]James Allen Fill, Svante Janson:
The number of bit comparisons used by Quicksort: an average-case analysis. SODA 2004: 300-307 - 2003
- [j14]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) - 2002
- [j13]James Allen Fill, Svante Janson:
Quicksort asymptotics. J. Algorithms 44(1): 4-28 (2002) - 2001
- [j12]James Allen Fill, Svante Janson:
Approximating the limiting Quicksort distribution. Random Struct. Algorithms 19(3-4): 376-406 (2001) - 2000
- [j11]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. Random Struct. Algorithms 16(2): 156-176 (2000) - [j10]James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal:
Extension of Fill's perfect rejection sampling algorithm to general chains. Random Struct. Algorithms 17(3-4): 290-316 (2000) - [j9]James Allen Fill, Donniell E. Fishkind:
The Moore-Penrose Generalized Inverse for Sums of Matrices. SIAM J. Matrix Anal. Appl. 21(2): 629-635 (2000) - [c2]James Allen Fill, Mark Huber:
The Randomness Recycler: A New Technique for Perfect Sampling. FOCS 2000: 503-511 - [i3]James Allen Fill, Svante Janson:
Smoothness and decay properties of the limiting Quicksort density function. CoRR math.PR/0005235 (2000) - [i2]James Allen Fill, Svante Janson:
A characterization of the set of fixed points of the Quicksort transformation. CoRR math.PR/0005236 (2000) - [i1]Luc Devroye, James Allen Fill, Ralph Neininger:
Perfect simulation from the Quicksort limit distribution. CoRR math.PR/0005237 (2000)
1990 – 1999
- 1999
- [j8]Robert P. Dobrow, James Allen Fill:
Total Path Length For Random Recursive Trees. Comb. Probab. Comput. 8(4): 317-333 (1999) - 1997
- [j7]James Allen Fill, Robert P. Dobrow:
The Number of m-ary Search Trees on n Keys. Comb. Probab. Comput. 6(4): 435-453 (1997) - [c1]James Allen Fill:
An Interruptible Algorithm for Perfect Sampling via Markov Chains. STOC 1997: 688-695 - 1996
- [j6]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) - [j5]James Allen Fill:
On the distribution of binary search trees under the random permutation model. Random Struct. Algorithms 8(1): 1-25 (1996) - [j4]James Allen Fill, Lars Holst:
On the distribution of search cost for the move-to-front rule. Random Struct. Algorithms 8(3): 179-186 (1996) - [j3]James Allen Fill:
Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. Theor. Comput. Sci. 164(1&2): 185-206 (1996) - 1992
- [j2]Persi Diaconis, James Allen Fill, Jim Pitman:
Analysis of Top To Random Shuffles. Comb. Probab. Comput. 1: 135-155 (1992)
1980 – 1989
- 1989
- [j1]James Allen Fill:
The Radon Transform on Zn. SIAM J. Discret. Math. 2(2): 262-283 (1989)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-23 21:03 CEST 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:
