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

researchr

You are not signed in
Sign in
Sign up

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.

Abstract is missing.

runs on WebDSL