The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David Semé: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Semé, Sidney Youlou
    Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:49-54 [Conf]
  2. David Semé, Sidney Youlou
    Parallel Algorithms for String Matching Problems on a Linear Array with Reconfigurable Pipelined Bus System. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:55-60 [Conf]
  3. Thierry Garcia, David Semé
    A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 2006, pp:301-306 [Conf]
  4. Thierry Lecroq, Jean Frédéric Myoupo, David Semé
    Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. [Citation Graph (0, 0)][DBLP]
    Computers and Their Applications, 2002, pp:18-21 [Conf]
  5. Thierry Garcia, David Semé
    A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word. [Citation Graph (0, 0)][DBLP]
    ICCSA (2), 2003, pp:239-248 [Conf]
  6. David Semé
    A CGM Algorithm Solving the Longest Increasing Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    ICCSA (5), 2006, pp:10-21 [Conf]
  7. Jean Carle, Jean Frédéric Myoupo, David Semé
    A Basis for 3-D Cellular Networks. [Citation Graph (0, 0)][DBLP]
    ICOIN, 2001, pp:631-636 [Conf]
  8. Ami Marowka, David Semé
    Power-dependable transactions in mobile networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  9. Anne-Elisabeth Baert, David Semé
    Voronoï Mobile Cellular Networks: Topological Properties. [Citation Graph (0, 0)][DBLP]
    ISPDC/HeteroPar, 2004, pp:29-35 [Conf]
  10. Catherine Decayeux, David Semé
    A New Model for 3-D Cellular Mobile Networks. [Citation Graph (0, 0)][DBLP]
    ISPDC/HeteroPar, 2004, pp:22-28 [Conf]
  11. Jean Carle, Jean Frédéric Myoupo, David Semé
    Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1999, pp:85-107 [Conf]
  12. Thierry Garcia, Jean Frédéric Myoupo, David Semé
    A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. [Citation Graph (0, 0)][DBLP]
    PDP, 2003, pp:349-356 [Conf]
  13. Anne-Elisabeth Baert, David Semé
    One-to-All Broadcasting in Voronoï Cellular Networks. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2003, pp:844-850 [Conf]
  14. Catherine Decayeux, David Semé
    Optimal Routing Algorithm on Hexagonal Networks Based on a New Addressing Scheme. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2003, pp:851-856 [Conf]
  15. David Semé
    Parallel Solution of the Point Location Problem Using Pipelined Optical Bus Systems. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2004, pp:606-609 [Conf]
  16. David Semé
    An Efficient Algorithm on the BSR-Based Parallel Architecture for the k-LCS Problem. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:1648-1654 [Conf]
  17. David Semé, Sidney Youlou
    Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems. [Citation Graph (0, 0)][DBLP]
    PDPTA, 2004, pp:617-622 [Conf]
  18. Thierry Garcia, Jean Frédéric Myoupo, David Semé
    A work-optimal CGM algorithm for the LIS problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:330-331 [Conf]
  19. Thierry Garcia, David Semé
    A Coarse-Grained Multicomputer algorithm for the detection of repetitions. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:93, n:6, pp:307-313 [Journal]
  20. Jean Frédéric Myoupo, David Semé
    Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:57, n:2, pp:212-223 [Journal]
  21. Jean Carle, Jean Frédéric Myoupo, David Semé
    All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:4, pp:539-550 [Journal]
  22. Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé
    A Constant Time Parallel Detection of Repetitions. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1999, v:9, n:1, pp:81-92 [Journal]
  23. Thierry Lecroq, Jean Frédéric Myoupo, David Semé
    A One-Phase Parallel Algorithm for the Sequence Alignment Problem. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1998, v:8, n:4, pp:515-526 [Journal]
  24. Jean Frédéric Myoupo, David Semé, Ivan Stojmenovic
    Optimal BSR Solutions to Several Convex Polygon Problems. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2002, v:21, n:1, pp:77-90 [Journal]
  25. Jean Frédéric Myoupo, David Semé
    Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2006, v:38, n:1, pp:83-107 [Journal]
  26. Catherine Decayeux, David Semé
    3D Hexagonal Network: Modeling, Topological Properties, Addressing Scheme, and Optimal Routing Algorithm. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 2005, v:16, n:9, pp:875-884 [Journal]
  27. David Semé, Sidney Youlou
    An Efficient Sequence Alignment Algorithm on a LARPBS. [Citation Graph (0, 0)][DBLP]
    ICCSA (3), 2007, pp:379-387 [Conf]

  28. An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS. [Citation Graph (, )][DBLP]


  29. Efficient BSR-Based Parallel Algorithms for Geometrical Problems. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.305secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002