# Radix sort trees in the large

title={Radix sort trees in the large},
author={Steven N. Evans and A. Wakolbinger},
journal={arXiv: Probability},
year={2016}
}
• Published 23 March 2016
• Computer Science
• arXiv: Probability
The trie-based radix sort algorithm stores pairwise different infinite binary strings in the leaves of a binary tree in a way that the Ulam-Harris coding of each leaf equals a prefix (that is, an initial segment) of the corresponding string, with the prefixes being of minimal length so that they are pairwise different. We investigate the {\em radix sort tree chains} -- the tree-valued Markov chains that arise when successively storing infinite binary strings $Z_1,\ldots, Z_n$, $n=1,2,\ldots… 5 Citations PATRICIA Bridges • Computer Science Genealogies of Interacting Particle Systems • 2020 The PATRICIA chains are investigated -- the tree-valued Markov chains that arise when successively building the PATRICia trees for the collection of infinite binary words and it turns out that these are the same as those of a chain introduced by R\'emy for successively generating uniform random binary trees with larger and larger numbers of leaves. Exchangeable interval hypergraphs and limits of ordered discrete structures A hypergraph$(V,E)$is called an interval hypergraph if there exists a linear order$l$on$V$such that every edge$e\in E$is an interval w.r.t.$l$; we also assume that$\{j\}\in E$for every DOOB-MARTIN COMPACTIFICATION OF A MARKOV CHAIN FOR GROWING RANDOM WORDS SEQUENTIALLY. • Mathematics Stochastic processes and their applications • 2017 A radix sorting parallel algorithm suitable for graphic processing unit computing • Computer Science Concurr. Comput. Pract. Exp. • 2021 The experimental results show that the B_LSD_RS parallel algorithm based on OpenCL not only achieves high performance but also achieves performance portability among different GPU computing platforms. ## References SHOWING 1-10 OF 11 REFERENCES A Limit Theorem for Radix Sort and Tries with Markovian Input • Computer Science ArXiv • 2015 A novel use of the contraction method combined with moment transfer techniques is used to prove a central limit theorem for the complexity of radix sort and for the external path length in a trie. Doob--Martin boundary of R\'emy's tree growth chain • Mathematics • 2014 R\'emy's algorithm is a Markov chain that iteratively generates a sequence of random trees in such a way that the$n^{\mathrm{th}}$tree is uniformly distributed over the set of rooted, planar, A Study of Trie-Like Structures Under the Density Model We consider random tries constructed from sequences of i .i.d . random variables with a common density f on [0,1] (i.e., paths down the tree are carved out by the bits in the binary expansions of the Trickle-down processes and their boundaries • Mathematics, Computer Science • 2010 A framework that encompasses Markov chains is introduced, and their asymptotic behavior is characterized by analyzing in detail their Doob-Martin compactifications, Poisson boundaries and tail$\sigma\$-fields.
Analysis of digital tries with Markovian dependency
• Computer Science
IEEE Trans. Inf. Theory
• 1991
A complete characterization of a digital tree is presented from the depth viewpoint in a Markovian framework, that is, under the assumption that symbols in a key are Markov-dependent, and shows that D/sub n/ tends to the normal distribution in all cases except the symmetric independent model.
The Art of Computer Programming
The arrangement of this invention provides a strong vibration free hold-down mechanism while avoiding a large pressure drop to the flow of coolant fluid.
Evolution of random search trees
• H. Mahmoud
• Mathematics
Wiley-Interscience series in discrete mathematics and optimization
• 1992
Time Series: The Asymptotic Distribution of Auto-Correlation Coefficients On a Test of Serial Correlation for Regression Models with Lagged Dependent Variables Directional Data Analysis: Optimal
Probabilistic Symmetries and Invariance Principles
The Basic Symmetries.- Conditioning and Martingales.- Convergence and Approximation.- Predictable Sampling and Mapping.- Decoupling Identities.- Homogeneity and Reflections.- Symmetric Arrays.-