Katy Paroux

Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes (2009)

Bernard, Samuel, Devismes, Stéphane, Paroux, Katy, Tixeuil, Sébastien

Nous considérons des réseaux unidirectionnels anonymes. Nous démontrons que contrairement aux réseaux bidirectionnels, l'auto-stabilisation de tâches locales peut y être aussi difficile que...

Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes (2009)

Bernard, Samuel, Devismes, Stéphane, Paroux, Katy, Tixeuil, Sébastien

Nous considérons des réseaux unidirectionnels anonymes. Nous démontrons que contrairement aux réseaux bidirectionnels, l'auto-stabilisation de tâches locales peut y être aussi difficile que...

Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes (2009)

Bernard, Samuel, Devismes, Stéphane, Paroux, Katy, Tixeuil, Sébastien

Nous considérons des réseaux unidirectionnels anonymes. Nous démontrons que contrairement aux réseaux bidirectionnels, l'auto-stabilisation de tâches locales peut y être aussi difficile que...

Sur le Coloriage Auto-stabilisant dans les Réseaux Unidirectionnels Anonymes (2009)

Bernard, Samuel, Devismes, Stéphane, Paroux, Katy, Tixeuil, Sébastien

Nous considérons des réseaux unidirectionnels anonymes. Nous démontrons que contrairement aux réseaux bidirectionnels, l'auto-stabilisation de tâches locales peut y être aussi difficile que...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used over the Internet. This continuous time Markov process takes its values in $[0,\infty)$, is...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables : Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables : Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used over the Internet. This continuous time Markov process takes its values in $[0,\infty)$, is...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

On the long time behavior of the TCP window size process (2008)

Chafai, Djalil, Malrieu, Florent, Paroux, Katy

The TCP window size process appears in the modeling of the famous Transmission Control Protocol used for data transmission over the Internet. This continuous time Markov process takes its values in...

Refined convergence for the Boolean model (2008)

Calka, Pierre, Michel, Julien, Paroux, Katy

In a previous work, two of the authors proposed a new proof of a well known convergence result for the scaled elementary connected vacant component in the high intensity Boolean model towards the...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables : Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables: Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Ascending runs in dependent uniformly distributed random variables : Application to wireless networks (2008)

Mitton, Nathalie, Paroux, Katy, Sericola, Bruno, Tixeuil, Sébastien

We analyze in this paper the longest increasing contiguous sequence or maximal ascending run of random variables with common uniform distribution but not independent. Their dependence is...

Local convergence of the Boolean shell model towards the thick Poisson hyperplane process in the Euclidean space (2003)

Michel, Julien, Paroux, Katy

In this article we prove local convergence for a Boolean model of shells conditioned by the noncovering of the origin towards the thick hyperplane Poisson process in the Euclidean space. The existing...

Quelques théorèmes centraux limites pour les processus Poissoniens de droites dans le plan (1998)

Paroux, Katy

We prove central limit theorems for certain geometrical characteristics of the convex polygons determined by a standard Poisson line process in the plane, such as: the angles at the vertices of the...