Pages that link to "Item:Q2900956"
From MaRDI portal
The following pages link to On the longest increasing subsequence for finite and countable alphabets (Q2900956):
Displaying 9 items.
- Asymptotics for random Young diagrams when the word length and alphabet size simultaneously grow to infinity (Q453272) (← links)
- On the limiting law of the length of the longest common and increasing subsequences in random words (Q529438) (← links)
- Longest increasing subsequences, Plancherel-type measure and the Hecke insertion algorithm (Q534213) (← links)
- On the rate of approximation in finite-alphabet longest increasing subsequence problems (Q1931327) (← links)
- On the limiting law of the length of the longest common and increasing subsequences in random words with arbitrary distribution (Q2042794) (← links)
- Multi-state asymmetric simple exclusion processes (Q2355674) (← links)
- Simultaneous large deviations for the shape of Young diagrams associated with random words (Q2515508) (← links)
- On the Limiting Shape of Young Diagrams Associated with Inhomogeneous Random Words (Q2840344) (← links)
- The Longest Almost-Increasing Subsequence (Q3578333) (← links)