Marcos A. Kiwi, Martin Loebl, Jirí Matousek. Expected Length of the Longest Common Subsequence for Large Alphabets. In Martin Farach-Colton, editor, LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings. Volume 2976 of Lecture Notes in Computer Science, pages 302-311, Springer, 2004. [doi]
@inproceedings{KiwiLM04,
title = {Expected Length of the Longest Common Subsequence for Large Alphabets},
author = {Marcos A. Kiwi and Martin Loebl and Jirí Matousek},
year = {2004},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2976&spage=302},
researchr = {https://researchr.org/publication/KiwiLM04},
cites = {0},
citedby = {0},
pages = {302-311},
booktitle = {LATIN 2004: Theoretical Informatics, 6th Latin American Symposium, Buenos Aires, Argentina, April 5-8, 2004, Proceedings},
editor = {Martin Farach-Colton},
volume = {2976},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-21258-2},
}