The problem of estimating the number $n$ of distinct keys of a large collection of $N$ data is well known in computer science. A classical algorithm is the adaptive sampling (AS). $n$ can be estimated by $R.2^D$, where $R$ is the final bucket (cache)...

Using the Saddle point method and multiseries expansions, we obtain from the exponential formula and Cauchy's integral formula,asymptotic results for the number $T(n,m,k)$ of partitions of $n$ labeled objects with $m$ blocks of fixed size $k$. We ana...

Let a word be a sequence of $n$ i.i.d. integer random variables. The perimeter $P$ of the word is the number of edges of the word, seen as a polyomino. In this paper, we present a probabilistic approach to the computation of the moments of $P$. This ...

Using the Saddle point method and multiseries expansions, we obtain from the exponential formula and Cauchy's integral formula,asymptotic results for the number $T(n,m,k)$ of partitions of $n$ labeled objects with $m$ blocks of fixed size $k$. We ana...

Using the Saddle point method and multiseries expansions, we obtain from the exponential formula and Cauchy's integral formula,asymptotic results for the number $T(n,m,k)$ of partitions of $n$ labeled objects with $m$ blocks of fixed size $k$. We ana...

Using the Saddle point method and multiseries expansions, we obtain from the exponential formula and Cauchy's integral formula,asymptotic results for the number $T(n,m,k)$ of partitions of $n$ labeled objects with $m$ blocks of fixed size $k$. We ana...

Using the Saddle point method and multiseries expansions, we obtain from the exponential formula and Cauchy's integral formula,asymptotic results for the number $T(n,m,k)$ of partitions of $n$ labeled objects with $m$ blocks of fixed size $k$. We ana...

In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m

In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m

In this paper, we consider hashing with linear probing for a hashing table with m places, n items (n < m), and l = m