44 citations · 279 across the 33 of their papers we have counts for
1 paper · 2 filters
Marcos Kiwi, Martin Loebl, Jiri Matousek
We consider the length L of the longest common subsequence of two randomly uniformly and independently chosen n character words over a k-ary alphabet. Subadditivity arguments yield…