most citedAlmost-sure asymptotic for the number of heaps inside a random sequence

2 citations · 2 across the 1 of their papers we have counts for

collaborators

1 paper

math.PR2017★ 2 cited

Almost-sure asymptotic for the number of heaps inside a random sequence

Anne-Laure Basdevant, Arvind Singh

We study the minimum number of heaps required to sort a random sequence using a generalization of Istrate and Bonchis's algorithm (2015). In a previous paper, the authors proved th…