Publisher
Springer Science and Business Media LLC
Reference9 articles.
1. M. Axenovich, Y. Person and S. Puzynina, A regularity lemma and twins in words, Journal of Combinatorial Theory. Series A 120 (2013), 733–743. arXiv:1204.2180.
2. R. C. Baker, G. Harman and J. Pintz, The difference between consecutive primes. II, Proceedings of the London Mathematical Society 83 (2001), 532–562.
3. P, Beame, E. Blaise and D.-T. Huynh-Ngoc, Longest common subsequences in sets of permutations, http://arxiv.org/pdf/0904.1615, April 2009.
4. P. Beame and D.-T. Huynh-Ngoc, On the value of multiple read/write streams for approximating frequency moments, ACM Transactions on Computation Theory 3 (2012), 6:1–6:22. http://eccc.hpi-web.de/report/2008/024/.
5. B. Bukh and J. Ma, Longest common subsequences in sets of words, SIAM Journal on Discrete Mathematics 28 (2014), 2042–2049. arXiv:1406.7017.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exponential Erdős–Szekeres theorem for matrices;Proceedings of the London Mathematical Society;2024-09
2. Shuffle squares and reverse shuffle squares;European Journal of Combinatorics;2024-02
3. Long Twins in Random Words;Annals of Combinatorics;2023-05-23
4. The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1/2;IEEE Transactions on Information Theory;2023-04
5. Erdős–Szekeres theorem for multidimensional arrays;Journal of the European Mathematical Society;2022-08-31