Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System

David Semé, Sidney Youlou. Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System. In Michael J. Oudshoorn, Sanguthevar Rajasekaran, editors, Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, September 12-14, 2005 Imperial Palace Hotel, Las Vegas, Nevada, USA. pages 49-54, ISCA, 2005.

@inproceedings{SemeY05,
  title = {Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System},
  author = {David Semé and Sidney Youlou},
  year = {2005},
  researchr = {https://researchr.org/publication/SemeY05},
  cites = {0},
  citedby = {0},
  pages = {49-54},
  booktitle = {Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, September 12-14, 2005 Imperial Palace Hotel, Las Vegas, Nevada, USA},
  editor = {Michael J. Oudshoorn and Sanguthevar Rajasekaran},
  publisher = {ISCA},
  isbn = {1-880843-56-0},
}