Peter Krusche, Alexandre Tiskin. Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism. In Marina L. Gavrilova, Osvaldo Gervasi, Vipin Kumar, Chih Jeng Kenneth Tan, David Taniar, Antonio Laganà , Youngsong Mun, Hyunseung Choo, editors, Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part V. Volume 3984 of Lecture Notes in Computer Science, pages 165-174, Springer, 2006. [doi]
@inproceedings{KruscheT06,
title = {Efficient Longest Common Subsequence Computation Using Bulk-Synchronous Parallelism},
author = {Peter Krusche and Alexandre Tiskin},
year = {2006},
doi = {10.1007/11751649_18},
url = {http://dx.doi.org/10.1007/11751649_18},
researchr = {https://researchr.org/publication/KruscheT06},
cites = {0},
citedby = {0},
pages = {165-174},
booktitle = {Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part V},
editor = {Marina L. Gavrilova and Osvaldo Gervasi and Vipin Kumar and Chih Jeng Kenneth Tan and David Taniar and Antonio Laganà and Youngsong Mun and Hyunseung Choo},
volume = {3984},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-34079-3},
}