The following pages link to Jean-Frédéric Myoupo (Q240449):
Displayed 14 items.
- Improved linear systolic algorithms for substring statistics (Q287010) (← links)
- A faster linear systolic algorithm for recovering a longest common subsequence (Q290200) (← links)
- (Q1183420) (redirect page) (← links)
- Dynamic programming on linear pipelines (Q1183421) (← links)
- Corrigenda to ``Dynamic programming on linear pipelines'' (Q1197984) (← links)
- Time-efficient parallel algorithms for the longest common subsequence and related problems (Q1291016) (← links)
- An application of an initialization protocol to permutation routing in a single-hop mobile ad hoc networks (Q1777612) (← links)
- Mapping dynamic programming onto modular linear systolic arrays (Q2365569) (← links)
- (Q3706986) (← links)
- (Q3729721) (← links)
- Systolic-based parallel architecture for the longest common subsequences problem (Q4224389) (← links)
- APPLICATION-SPECIFIC ARRAY PROCESSORS FOR THE LONGEST COMMON SUBSEQUENCE PROBLEM OF THREE SEQUENCES ∗ † (Q4240887) (← links)
- (Q4953333) (← links)
- Optimal BSR solutions to several convex polygon problems (Q5960443) (← links)