Pages that link to "Item:Q5901650"
From MaRDI portal
The following pages link to LATIN 2004: Theoretical Informatics (Q5901650):
Displaying 15 items.
- Repetition-free longest common subsequence of random sequences (Q299053) (← links)
- On the asymptotic average length of a maximum common subsequence for words over a finite alphabet (Q671435) (← links)
- Maximal length of common words among random letter sequences (Q1103263) (← links)
- Bounding the expected length of longest common subsequences and forests (Q1293550) (← links)
- The rate of convergence of the mean length of the longest common subsequence (Q1345582) (← links)
- A note on the expected length of the longest common subsequences of two i.i.d. random permutations (Q1648658) (← links)
- Longest common extension (Q1678103) (← links)
- On rates of convergence for common subsequences and first passage time (Q1894615) (← links)
- Longest common substring for random subshifts of finite type (Q2077341) (← links)
- Expected length of the longest common subsequence for large alphabets (Q2573406) (← links)
- (Q3766559) (← links)
- Common Subsequences and Supersequences and their Expected Length (Q4238165) (← links)
- Expected Number of Distinct Subsequences in Randomly Generated Binary Strings (Q4560193) (← links)
- Large deviations-based upper bounds on the expected relative length of longest common subsequences (Q5395363) (← links)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes (Q6134808) (← links)
