The following pages link to (Q4508919):
Displaying 15 items.
- Optimal online selection of a monotone subsequence: a central limit theorem (Q491928) (← links)
- Accuracy and stability of computing high-order derivatives of analytic functions by Cauchy integrals (Q626444) (← links)
- Precise asymptotics for random matrices and random growth models (Q943536) (← links)
- On parity and characters of symmetric groups (Q1633375) (← links)
- The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets (Q2218834) (← links)
- On the distribution of the length of the longest increasing subsequence in a random permutation (Q2516396) (← links)
- Almost all entries in the character table of the symmetric group are multiples of any given prime (Q2673070) (← links)
- Finite size corrections relating to distributions of the length of longest increasing subsequences (Q2687279) (← links)
- Empirical scaling of the length of the longest increasing subsequences of random walks (Q2969875) (← links)
- On the distribution of the length of the longest increasing subsequence of random permutations (Q4257713) (← links)
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem (Q4269106) (← links)
- Online Scheduling with Increasing Subsequence Serving Constraint (Q4632179) (← links)
- Variations on Hammersley’s interacting particle process (Q5051443) (← links)
- Connect the dots: how many random points can a regular curve pass through? (Q5697192) (← links)
- Asymptotic expansions relating to the distribution of the length of longest increasing subsequences (Q6193734) (← links)
