Pages that link to "Item:Q908915"
From MaRDI portal
The following pages link to Descending subsequences of random permutations (Q908915):
Displaying 9 items.
- Optimal online selection of a monotone subsequence: a central limit theorem (Q491928) (← links)
- Untangling planar graphs from a specified vertex position-Hard cases (Q534342) (← links)
- Descending subsequences of random permutations (Q908915) (← links)
- A note on the expected length of the longest common subsequences of two i.i.d. random permutations (Q1648658) (← links)
- The distribution of the length of the longest increasing subsequence in random permutations of arbitrary multi-sets (Q2218834) (← links)
- On the Height of a Random Set of Points in a d-Dimensional Unit Cube (Q3146574) (← links)
- Improved Bounds on Security Reductions for Discrete Log Based Signatures (Q3600215) (← links)
- Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem (Q4269106) (← links)
- An asymptotically optimal algorithm for online stacking (Q6040850) (← links)
