In this paper, we study the generating functions for the number of set partitions of [n]
according to the number/sum of elements protected by weak/strong records (smaller …

Protected nodes, ie, nodes with distance at least 2 to each leaf, have been studied in various
classes of random rooted trees. In this short note, we investigate the protected node profile …

Protected nodes are neither leaves nor parents of any leaves in a rooted tree. We study here
protected node profile, namely, the number of protected nodes with the same distance from …

The thesis is about the probability distribution of the profile of tries, whose entries are given
by an asymmetric Bernoulli distribution. We therefore need tools from analytic combina …

Защищенные вершины, т. е. вершины с расстоянием не менее 2 до ближайшего листа,
были изучены для различных классов случайных корневых деревьев. В предложенной …

Graph tries are a new and interesting data structure proposed by Jacquet in 2014. They
generalize the classical trie data structure which has found many applications in computer …