Pages that link to "Item:Q1066678"
From MaRDI portal
The following pages link to A systolic array for the longest common subsequence problem (Q1066678):
Displaying 5 items.
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- Computational geometry algorithms for the systolic screen (Q1175650) (← links)
- Catastrophic faults in reconfigurable systolic linear arrays (Q1363642) (← links)
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
- DERIVING A FAST SYSTOLIC ALGORITHM FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM (Q4532713) (← links)
