- CSB - MetaPress - Google - Bing - Yahoo
 | 2007 | |
|---|---|---|
| j10 |      | David Semé, Sidney Youlou: Repetitions detection on a linear array with reconfigurable pipelined bus system. IJPEDS 22(3): 173-183 (2007) |
| c21 | | David Semé, Sidney Youlou: An Efficient Sequence Alignment Algorithm on a LARPBS. ICCSA (3) 2007: 379-387 |
| c20 | | David Semé, Sidney Youlou: An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS. PDCAT 2007: 251-258 |
| 2006 | ||
| j9 | | Jean Frédéric Myoupo, David Semé: Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. The Journal of Supercomputing 38(1): 83-107 (2006) |
| c19 |  | Thierry Garcia, David Semé: A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms. Computers and Their Applications 2006: 301-306 |
| c18 | | David Semé: A CGM Algorithm Solving the Longest Increasing Subsequence Problem. ICCSA (5) 2006: 10-21 |
| c17 | | |
| 2005 | ||
| j8 | | Thierry Garcia, David Semé: A Coarse-Grained Multicomputer algorithm for the detection of repetitions. Inf. Process. Lett. 93(6): 307-313 (2005) |
| j7 | | Catherine Decayeux, David Semé: 3D Hexagonal Network: Modeling, Topological Properties, Addressing Scheme, and Optimal Routing Algorithm. IEEE Trans. Parallel Distrib. Syst. 16(9): 875-884 (2005) |
| c16 | | David Semé, Sidney Youlou: Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System. ISCA PDCS 2005: 49-54 |
| c15 | | David Semé, Sidney Youlou: Parallel Algorithms for String Matching Problems on a Linear Array with Reconfigurable Pipelined Bus System. ISCA PDCS 2005: 55-60 |
| 2004 | ||
| c14 | | Catherine Decayeux, David Semé: A New Model for 3-D Cellular Mobile Networks. ISPDC/HeteroPar 2004: 22-28 |
| c13 | | Anne-Elisabeth Baert, David Semé: Voronoï Mobile Cellular Networks: Topological Properties. ISPDC/HeteroPar 2004: 29-35 |
| c12 | | David Semé: Parallel Solution of the Point Location Problem Using Pipelined Optical Bus Systems. PDPTA 2004: 606-609 |
| c11 | | David Semé, Sidney Youlou: Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems. PDPTA 2004: 617-622 |
| 2003 | ||
| c10 | | Thierry Garcia, David Semé: A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word. ICCSA (2) 2003: 239-248 |
| c9 | | Thierry Garcia, Jean Frédéric Myoupo, David Semé: A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. PDP 2003: 349-356 |
| c8 | | Anne-Elisabeth Baert, David Semé: One-to-All Broadcasting in Voronoï Cellular Networks. PDPTA 2003: 844-850 |
| c7 | | Catherine Decayeux, David Semé: Optimal Routing Algorithm on Hexagonal Networks Based on a New Addressing Scheme. PDPTA 2003: 851-856 |
| 2002 | ||
| j6 | | Jean Frédéric Myoupo, David Semé, Ivan Stojmenovic: Optimal BSR Solutions to Several Convex Polygon Problems. The Journal of Supercomputing 21(1): 77-90 (2002) |
| c6 | | Thierry Lecroq, Jean Frédéric Myoupo, David Semé: Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. Computers and Their Applications 2002: 18-21 |
| 2001 | ||
| c5 | | Jean Carle, Jean Frédéric Myoupo, David Semé: A Basis for 3-D Cellular Networks. ICOIN 2001: 631-636 |
| c4 | | David Semé, Jean Frédéric Myoupo: Efficient BSR-Based Parallel Algorithms for Geometrical Problems. PDP 2001: 265-272 |
| c3 | | Thierry Garcia, Jean Frédéric Myoupo, David Semé: A work-optimal CGM algorithm for the LIS problem. SPAA 2001: 330-331 |
| 2000 | ||
| j5 | | Jean Frédéric Myoupo, David Semé: Efficient Parallel Algorithms for the Lis and Lcs Problems on Bsr Model Using Constant Number of Selections. Parallel Algorithms Appl. 14(3): 187-202 (2000) |
| 1999 | ||
| j4 | | Jean Frédéric Myoupo, David Semé: Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. J. Parallel Distrib. Comput. 57(2): 212-223 (1999) |
| j3 | | Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé: A Constant Time Parallel Detection of Repetitions. Parallel Processing Letters 9(1): 81-92 (1999) |
| j2 | | Jean Carle, Jean Frédéric Myoupo, David Semé: All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. Parallel Processing Letters 9(4): 539-550 (1999) |
| c2 | | Jean Carle, Jean Frédéric Myoupo, David Semé: Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. OPODIS 1999: 85-107 |
| c1 | | David Semé: An Efficient Algorithm on the BSR-Based Parallel Architecture for the k-LCS Problem. PDPTA 1999: 1648-1654 |
| 1998 | ||
| j1 | | Thierry Lecroq, Jean Frédéric Myoupo, David Semé: A One-Phase Parallel Algorithm for the Sequence Alignment Problem. Parallel Processing Letters 8(4): 515-526 (1998) |
| 1 | Anne-Elisabeth Baert | |
| 2 | Jean Carle | |
| 3 | Catherine Decayeux | |
| 4 | Emmanuel Delacourt | |
| 5 | Thierry Garcia | |
| 6 | Thierry Lecroq | |
| 7 | Ami Marowka | |
| 8 | Jean Frédéric Myoupo | |
| 9 | Ivan Stojmenovic | |
| 10 | Sidney Youlou |
Data released under the ODC-BY 1.0 license — See also our legal information page