AbstractIn this short note we prove a concentration result for the length of the longest increasing subsequence (LIS) of a randomly and uniformly chosen involution of {1,…,s}
Götze F, Zaitsev AY. A New Bound in the Littlewood–Offord Problem. Mathematics. 2022;10(10): 1740.Th...
Both for random words and random permutations, I will present a panoramic view of recent results on...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
In this short note we prove a concentration result for the length of the longest increasing subseque...
In this short note we prove a concentration result for the length of the longest increasing subseque...
AbstractIn this short note we prove a concentration result for the length of the longest increasing ...
AbstractLetLnbe the length of a longest increasing subsequence in a random permutation of {1, …, n}....
Artículo de publicación ISITo Philippe Flajolet, a mathematical discontinuity, a tamer of singularit...
Artículo de publicación ISITo Philippe Flajolet, a mathematical discontinuity, a tamer of singularit...
The expected value of L_n, the length of the longest increasing subsequence of a random permutation ...
AbstractLet Ln be the length of the longest increasing subsequence of a random permutation of the nu...
in PressInternational audienceLet $X=(X_i)_{i\ge 1}$ and $Y=(Y_i)_{i\ge 1}$ be two sequences of inde...
AbstractThe problems considered here deal with the distribution of the lengths of the longest monoto...
From a given sequence of numbers (Si) of length n, we consider the longest weakly increasing subsequ...
Thesis (Ph. D.)--University of Rochester. Dept. of Mathematics, 2015.Concentration of measure is a p...
Götze F, Zaitsev AY. A New Bound in the Littlewood–Offord Problem. Mathematics. 2022;10(10): 1740.Th...
Both for random words and random permutations, I will present a panoramic view of recent results on...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
In this short note we prove a concentration result for the length of the longest increasing subseque...
In this short note we prove a concentration result for the length of the longest increasing subseque...
AbstractIn this short note we prove a concentration result for the length of the longest increasing ...
AbstractLetLnbe the length of a longest increasing subsequence in a random permutation of {1, …, n}....
Artículo de publicación ISITo Philippe Flajolet, a mathematical discontinuity, a tamer of singularit...
Artículo de publicación ISITo Philippe Flajolet, a mathematical discontinuity, a tamer of singularit...
The expected value of L_n, the length of the longest increasing subsequence of a random permutation ...
AbstractLet Ln be the length of the longest increasing subsequence of a random permutation of the nu...
in PressInternational audienceLet $X=(X_i)_{i\ge 1}$ and $Y=(Y_i)_{i\ge 1}$ be two sequences of inde...
AbstractThe problems considered here deal with the distribution of the lengths of the longest monoto...
From a given sequence of numbers (Si) of length n, we consider the longest weakly increasing subsequ...
Thesis (Ph. D.)--University of Rochester. Dept. of Mathematics, 2015.Concentration of measure is a p...
Götze F, Zaitsev AY. A New Bound in the Littlewood–Offord Problem. Mathematics. 2022;10(10): 1740.Th...
Both for random words and random permutations, I will present a panoramic view of recent results on...
We consider the length L of the longest common subsequence of two randomly uniformly and independent...
DOI
Add to ORKG