| 2007 |
|---|
| 30 | EE | David Semé,
Sidney Youlou:
An Efficient Sequence Alignment Algorithm on a LARPBS.
ICCSA (3) 2007: 379-387 |
| 29 | EE | David Semé,
Sidney Youlou:
An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS.
PDCAT 2007: 251-258 |
| 28 | EE | David Semé,
Sidney Youlou:
Repetitions detection on a linear array with reconfigurable pipelined bus system.
IJPEDS 22(3): 173-183 (2007) |
| 2006 |
|---|
| 27 | | Thierry Garcia,
David Semé:
A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms.
Computers and Their Applications 2006: 301-306 |
| 26 | EE | David Semé:
A CGM Algorithm Solving the Longest Increasing Subsequence Problem.
ICCSA (5) 2006: 10-21 |
| 25 | EE | Ami Marowka,
David Semé:
Power-dependable transactions in mobile networks.
IPDPS 2006 |
| 24 | EE | 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) |
| 2005 |
|---|
| 23 | | David Semé,
Sidney Youlou:
Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System.
ISCA PDCS 2005: 49-54 |
| 22 | | David Semé,
Sidney Youlou:
Parallel Algorithms for String Matching Problems on a Linear Array with Reconfigurable Pipelined Bus System.
ISCA PDCS 2005: 55-60 |
| 21 | EE | 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) |
| 20 | EE | Thierry Garcia,
David Semé:
A Coarse-Grained Multicomputer algorithm for the detection of repetitions.
Inf. Process. Lett. 93(6): 307-313 (2005) |
| 2004 |
|---|
| 19 | EE | Catherine Decayeux,
David Semé:
A New Model for 3-D Cellular Mobile Networks.
ISPDC/HeteroPar 2004: 22-28 |
| 18 | EE | Anne-Elisabeth Baert,
David Semé:
Voronoï Mobile Cellular Networks: Topological Properties.
ISPDC/HeteroPar 2004: 29-35 |
| 17 | | David Semé:
Parallel Solution of the Point Location Problem Using Pipelined Optical Bus Systems.
PDPTA 2004: 606-609 |
| 16 | | David Semé,
Sidney Youlou:
Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems.
PDPTA 2004: 617-622 |
| 2003 |
|---|
| 15 | EE | 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 |
| 14 | EE | Thierry Garcia,
Jean Frédéric Myoupo,
David Semé:
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem.
PDP 2003: 349-356 |
| 13 | | Anne-Elisabeth Baert,
David Semé:
One-to-All Broadcasting in Voronoï Cellular Networks.
PDPTA 2003: 844-850 |
| 12 | | Catherine Decayeux,
David Semé:
Optimal Routing Algorithm on Hexagonal Networks Based on a New Addressing Scheme.
PDPTA 2003: 851-856 |
| 2002 |
|---|
| 11 | | 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 |
| 10 | | 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) |
| 2001 |
|---|
| 9 | EE | Jean Carle,
Jean Frédéric Myoupo,
David Semé:
A Basis for 3-D Cellular Networks.
ICOIN 2001: 631-636 |
| 8 | EE | Thierry Garcia,
Jean Frédéric Myoupo,
David Semé:
A work-optimal CGM algorithm for the LIS problem.
SPAA 2001: 330-331 |
| 2000 |
|---|
| 7 | EE | 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 |
|---|
| 6 | | 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 |
| 5 | | David Semé:
An Efficient Algorithm on the BSR-Based Parallel Architecture for the k-LCS Problem.
PDPTA 1999: 1648-1654 |
| 4 | | 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) |
| 3 | | Emmanuel Delacourt,
Jean Frédéric Myoupo,
David Semé:
A Constant Time Parallel Detection of Repetitions.
Parallel Processing Letters 9(1): 81-92 (1999) |
| 2 | | 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) |
| 1998 |
|---|
| 1 | | 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) |
