Repetitions detection on a linear array with reconfigurable pipelined bus system.

David Semé

David Semé Sidney Youlou Repetitions detection on a linear array with reconfigurable pipelined bus system. 173-183 2007 22 Int. J. Parallel Emergent Distributed Syst. 3 https://doi.org/10.1080/17445760601125434 db/journals/paapp/paapp22.html#SemeY07

David Semé Sidney Youlou An Efficient Sequence Alignment Algorithm on a LARPBS. 379-387 2007 conf/iccsa/2007-3 ICCSA (3) https://doi.org/10.1007/978-3-540-74484-9_33 db/conf/iccsa/iccsa2007-3.html#SemeY07 David Semé Sidney Youlou An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS. 251-258 2007 PDCAT https://doi.org/10.1109/PDCAT.2007.74 https://doi.ieeecomputersociety.org/10.1109/PDCAT.2007.74 conf/pdcat/2007 db/conf/pdcat/pdcat2007.html#SemeY07

Jean Frédéric Myoupo David Semé Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. 83-107 2006 38 J. Supercomput. 1 https://doi.org/10.1007/s11227-006-9157-5 db/journals/tjs/tjs38.html#MyoupoS06

Thierry Garcia David Semé A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms. 301-306 2006 conf/cata/2006 CATA db/conf/cata/cata2006.html#GarciaS06 David Semé A CGM Algorithm Solving the Longest Increasing Subsequence Problem. 10-21 2006 conf/iccsa/2006-5 ICCSA (5) https://doi.org/10.1007/11751649_2 db/conf/iccsa/iccsa2006-5.html#Seme06 Ami Marowka David Semé Power-dependable transactions in mobile networks. 2006 conf/ipps/2006 IPDPS https://doi.org/10.1109/IPDPS.2006.1639667 https://doi.ieeecomputersociety.org/10.1109/IPDPS.2006.1639667 db/conf/ipps/ipdps2006.html#MarowkaS06

Thierry Garcia David Semé A Coarse-Grained Multicomputer algorithm for the detection of repetitions. 307-313 2005 93 Inf. Process. Lett. 6 https://doi.org/10.1016/j.ipl.2004.12.004 db/journals/ipl/ipl93.html#GarciaS05

Catherine Decayeux David Semé 3D Hexagonal Network: Modeling, Topological Properties, Addressing Scheme, and Optimal Routing Algorithm. 875-884 2005 16 IEEE Trans. Parallel Distributed Syst. 9 https://doi.org/10.1109/TPDS.2005.100 http://doi.ieeecomputersociety.org/10.1109/TPDS.2005.100 db/journals/tpds/tpds16.html#DecayeuxS05

David Semé Sidney Youlou Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System. 49-54 2005 conf/ISCApdcs/2005 PDCS db/conf/ISCApdcs/ISCApdcs2005.html#SemeY05 David Semé Sidney Youlou Parallel Algorithms for String Matching Problems on a Linear Array with Reconfigurable Pipelined Bus System. 55-60 2005 conf/ISCApdcs/2005 PDCS db/conf/ISCApdcs/ISCApdcs2005.html#SemeY05a Catherine Decayeux David Semé A New Model for 3-D Cellular Mobile Networks. 22-28 2004 conf/ispdc/2004 ISPDC/HeteroPar https://doi.org/10.1109/ISPDC.2004.4 https://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.4 db/conf/ispdc/ispdc2004.html#DecayeuxS04 Anne-Elisabeth Baert David Semé Voronoï Mobile Cellular Networks: Topological Properties. 29-35 2004 conf/ispdc/2004 ISPDC/HeteroPar https://doi.org/10.1109/ISPDC.2004.58 https://doi.ieeecomputersociety.org/10.1109/ISPDC.2004.58 db/conf/ispdc/ispdc2004.html#BaertS04 David Semé Parallel Solution of the Point Location Problem Using Pipelined Optical Bus Systems. 606-609 2004 conf/pdpta/2004-2 PDPTA db/conf/pdpta/pdpta2004-2.html#Seme04 David Semé Sidney Youlou Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems. 617-622 2004 conf/pdpta/2004-2 PDPTA db/conf/pdpta/pdpta2004-2.html#SemeY04 Thierry Garcia David Semé A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word. 239-248 https://doi.org/10.1007/3-540-44843-8_26 2003 conf/iccsa/2003-2 ICCSA (2) db/conf/iccsa/iccsa2003-2.html#GarciaS03 Thierry Garcia Jean Frédéric Myoupo David Semé A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. 349-356 2003 conf/pdp/2003 PDP https://doi.org/10.1109/EMPDP.2003.1183610 https://doi.ieeecomputersociety.org/10.1109/EMPDP.2003.1183610 db/conf/pdp/pdp2003.html#GarciaMS03 Anne-Elisabeth Baert David Semé One-to-All Broadcasting in Voronoï Cellular Networks. 844-850 2003 conf/pdpta/2003-2 PDPTA db/conf/pdpta/pdpta2003-2.html#BaertS03 Catherine Decayeux David Semé Optimal Routing Algorithm on Hexagonal Networks Based on a New Addressing Scheme. 851-856 2003 conf/pdpta/2003-2 PDPTA db/conf/pdpta/pdpta2003-2.html#DecayeuxS03

Jean Frédéric Myoupo David Semé Ivan Stojmenovic Optimal BSR Solutions to Several Convex Polygon Problems. 77-90 2002 21 J. Supercomput. 1 db/journals/tjs/tjs21.html#MyoupoSS02 https://doi.org/10.1023/A:1013587415197

Thierry Lecroq Jean Frédéric Myoupo David Semé Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. 18-21 2002 conf/cata/2002 CATA db/conf/cata/cata2002.html#LecroqMS02 Jean Carle Jean Frédéric Myoupo David Semé A Basis for 3-D Cellular Networks. 631-636 2001 conf/icoin/2001 ICOIN https://doi.org/10.1109/ICOIN.2001.905525 https://doi.ieeecomputersociety.org/10.1109/ICOIN.2001.905525 db/conf/icoin/icoin2001.html#CarleMS01 David Semé Jean Frédéric Myoupo Efficient BSR-Based Parallel Algorithms for Geometrical Problems. 265-272 2001 PDP https://doi.org/10.1109/EMPDP.2001.905052 https://doi.ieeecomputersociety.org/10.1109/EMPDP.2001.905052 conf/pdp/2001 db/conf/pdp/pdp2001.html#SemeM01 Thierry Garcia Jean Frédéric Myoupo David Semé A work-optimal CGM algorithm for the LIS problem. 330-331 2001 conf/spaa/2001 SPAA https://doi.org/10.1145/378580.378756 db/conf/spaa/spaa2001.html#GarciaMS01

Jean Frédéric Myoupo David Semé Efficient Parallel Algorithms for the Lis and Lcs Problems on Bsr Model Using Constant Number of Selections. 187-202 2000 14 Parallel Algorithms Appl. 3 https://doi.org/10.1080/10637199808947386 db/journals/paapp/paapp14.html#MyoupoS00

Jean Frédéric Myoupo David Semé Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. 212-223 1999 57 J. Parallel Distributed Comput. 2 db/journals/jpdc/jpdc57.html#MyoupoS99 https://doi.org/10.1006/jpdc.1999.1534

Emmanuel Delacourt Jean Frédéric Myoupo David Semé A Constant Time Parallel Detection of Repetitions. 81-92 1999 9 Parallel Process. Lett. 1 db/journals/ppl/ppl9.html#DelacourtMS99 https://doi.org/10.1142/S0129626499000104

Jean Carle Jean Frédéric Myoupo David Semé All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. 539-550 1999 9 Parallel Process. Lett. 4 db/journals/ppl/ppl9.html#CarleMS99 https://doi.org/10.1142/S0129626499000505 https://www.wikidata.org/entity/Q113268623

Jean Carle Jean Frédéric Myoupo David Semé Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. 85-107 1999 conf/opodis/1999 OPODIS db/conf/opodis/opodis99.html#CarleMS99 David Semé An Efficient Algorithm on the BSR-Based Parallel Architecture for the k-LCS Problem. 1648-1654 1999 conf/pdpta/1999 PDPTA db/conf/pdpta/pdpta1999-3.html#Seme99

Thierry Lecroq Jean Frédéric Myoupo David Semé A One-Phase Parallel Algorithm for the Sequence Alignment Problem. 515-526 1998 8 Parallel Process. Lett. 4 db/journals/ppl/ppl8.html#LecroqMS98 https://doi.org/10.1142/S012962649800050X

Jean Frédéric Myoupo David Semé A single-layer systolic architecture for backpropagation learning. 1329-1333 1996 ICNN https://doi.org/10.1109/ICNN.1996.549091 conf/icnn/1996 db/conf/icnn/icnn1996.html#MyoupoS96 Anne-Elisabeth Baert Jean Carle Catherine Decayeux Emmanuel Delacourt Thierry Garcia Thierry Lecroq Ami Marowka Jean Frédéric Myoupo Ivan Stojmenovic Sidney Youlou