Skip to Main content Skip to Navigation
Conference papers

On unary nodes in tries

Abstract : The difference between ordinary tries and Patricia tries lies in the fact that all unary nodes are removed in the latter. Their average number is thus easily determined from earlier results on the size of tries/Patricia tries. In a well-known contention resolution algorithm, whose probabilistic model is essentially equivalent to tries, unary nodes correspond to repetitions, i.e., steps in the algorithm that do not resolve anything at all. In this paper, we take an individual's view on such repetitions: we consider the distribution of the number of repetitions a certain contender encounters in the course of the algorithm―-which is equivalent to the number of unary nodes on the path from the root to a random string in a trie. We encounter an example of a sequence of distributions that does not actually converge to a limit distribution, but rather oscillates around a (discrete) limit distribution.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 20, 2015 - 4:32:35 PM
Last modification on : Tuesday, March 7, 2017 - 3:07:50 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 9:47:36 AM


Publisher files allowed on an open archive




Stephan Wagner. On unary nodes in tries. 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA'10), 2010, Vienna, Austria. pp.577-590, ⟨10.46298/dmtcs.2776⟩. ⟨hal-01185574⟩



Record views


Files downloads