November 2004A simple approach is presented to study the asymptotic behavior of some algorithms with an underlying tree structure. It is shown that some asymptotic oscillating behaviors can be precisely analyzed without resorting to complex analysis techniques as it is usually done in this context. A new explicit representation of periodic functions involved is obtained at the same time
Dans cette thèse nous étudions des classes d’arbres étiquetés selon différents modèles d’étiquetages...
We consider a leader election algorithm in which a set of distributed objects (people, computers, et...
We report a novel asymptotic (large-order) behavior in an explicit sequence built out of the Bernoul...
November 2004In this paper a general class of tree algorithms is analyzed. It is shown that, by usin...
It is well known that many distributions that arise in the analysis of algorithms have an asymptotic...
The average case analysis of algorithms can avail itself of the development of synthetic methods in ...
AbstractHigh order differences of simple number sequences may be analysed asymptotically by means of...
This report is part of a projected series whose aim is to present in a synthetic way the major metho...
In this paper, a general tree algorithm processing a random flow of arrivals is analyzed. Capetanaki...
Cette thèse est dédiée à l'étude d'une large classe d'algorithmes, appelés algorithmes en arbre. En ...
This thesis is dedicated to the study of the asymptotic behavior of some large random graphs and tre...
In this thesis a general class of tree algorithms is analyzed. It is shown that, by using an appropr...
AbstractWe derive asymptotic approximations for the sequence f(n) defined recursively by f(n)=min1⩽j...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
AbstractMany probabilistic properties of elementary discrete combinatorial structures of interest fo...
Dans cette thèse nous étudions des classes d’arbres étiquetés selon différents modèles d’étiquetages...
We consider a leader election algorithm in which a set of distributed objects (people, computers, et...
We report a novel asymptotic (large-order) behavior in an explicit sequence built out of the Bernoul...
November 2004In this paper a general class of tree algorithms is analyzed. It is shown that, by usin...
It is well known that many distributions that arise in the analysis of algorithms have an asymptotic...
The average case analysis of algorithms can avail itself of the development of synthetic methods in ...
AbstractHigh order differences of simple number sequences may be analysed asymptotically by means of...
This report is part of a projected series whose aim is to present in a synthetic way the major metho...
In this paper, a general tree algorithm processing a random flow of arrivals is analyzed. Capetanaki...
Cette thèse est dédiée à l'étude d'une large classe d'algorithmes, appelés algorithmes en arbre. En ...
This thesis is dedicated to the study of the asymptotic behavior of some large random graphs and tre...
In this thesis a general class of tree algorithms is analyzed. It is shown that, by using an appropr...
AbstractWe derive asymptotic approximations for the sequence f(n) defined recursively by f(n)=min1⩽j...
AbstractArithmetic functions related to number representation systems exhibit various periodicity ph...
AbstractMany probabilistic properties of elementary discrete combinatorial structures of interest fo...
Dans cette thèse nous étudions des classes d’arbres étiquetés selon différents modèles d’étiquetages...
We consider a leader election algorithm in which a set of distributed objects (people, computers, et...
We report a novel asymptotic (large-order) behavior in an explicit sequence built out of the Bernoul...
DOI
Add to ORKG