The following pages link to Adeline Pierrot (Q526813):
Displaying 16 items.
- An algorithm computing combinatorial specifications of permutation classes (Q526814) (← links)
- The Brownian limit of separable permutations (Q1660630) (← links)
- Median of 3 Permutations, 3-Cycles and 3-Hitting Set problem (Q1671005) (← links)
- Scaling limits of permutation classes with a finite specification: a dichotomy (Q2155196) (← links)
- Universal limits of substitution-closed permutation classes (Q2216743) (← links)
- An algorithm for deciding the finiteness of the number of simple permutations in permutation classes (Q2255003) (← links)
- 2-stack sorting is polynomial (Q2363966) (← links)
- Single and Multiple Consecutive Permutation Motif Search (Q2872072) (← links)
- (Q2915601) (← links)
- (Q2960003) (← links)
- 2-Stack Sorting is polynomial (Q2965521) (← links)
- Linear-sized independent sets in random cographs and increasing subsequences in separable permutations (Q5051470) (← links)
- Combinatorial specification of permutation classes (Q5377427) (← links)
- A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings (Q6066864) (← links)
- Random cographs: Brownian graphon limit and asymptotic degree distribution (Q6074680) (← links)
- Dense and nondense limits for uniform random intersection graphs (Q6521096) (← links)
