default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Semé
Person information
Other persons with a similar name
- David Semedo
![[0000-0002-2403-0058]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-2403-0058")
- Davide Semenzin
- Bart D. Semeraro (aka: B. David Semeraro)
- Davide Semeraro
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j10]David Semé, Sidney Youlou:
Repetitions detection on a linear array with reconfigurable pipelined bus system. Int. J. Parallel Emergent Distributed Syst. 22(3): 173-183 (2007)- [c22]David Semé, Sidney Youlou:
An Efficient Sequence Alignment Algorithm on a LARPBS. ICCSA (3) 2007: 379-387 - [c21]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. J. Supercomput. 38(1): 83-107 (2006) - [c20]Thierry Garcia, David Semé:
A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms. CATA 2006: 301-306 - [c19]David Semé:
A CGM Algorithm Solving the Longest Increasing Subsequence Problem. ICCSA (5) 2006: 10-21 - [c18]Ami Marowka, David Semé:
Power-dependable transactions in mobile networks. IPDPS 2006 - 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 Distributed Syst. 16(9): 875-884 (2005) - [c17]David Semé, Sidney Youlou:
Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System. PDCS 2005: 49-54 - [c16]David Semé, Sidney Youlou:
Parallel Algorithms for String Matching Problems on a Linear Array with Reconfigurable Pipelined Bus System. PDCS 2005: 55-60 - 2004
- [c15]Catherine Decayeux, David Semé:
A New Model for 3-D Cellular Mobile Networks. ISPDC/HeteroPar 2004: 22-28 - [c14]Anne-Elisabeth Baert, David Semé:
Voronoï Mobile Cellular Networks: Topological Properties. ISPDC/HeteroPar 2004: 29-35 - [c13]David Semé:
Parallel Solution of the Point Location Problem Using Pipelined Optical Bus Systems. PDPTA 2004: 606-609 - [c12]David Semé, Sidney Youlou:
Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems. PDPTA 2004: 617-622 - 2003
- [c11]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 - [c10]Thierry Garcia, Jean Frédéric Myoupo, David Semé:
A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem. PDP 2003: 349-356 - [c9]Anne-Elisabeth Baert, David Semé:
One-to-All Broadcasting in Voronoï Cellular Networks. PDPTA 2003: 844-850 - [c8]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. J. Supercomput. 21(1): 77-90 (2002) - [c7]Thierry Lecroq, Jean Frédéric Myoupo, David Semé:
Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word. CATA 2002: 18-21 - 2001
- [c6]Jean Carle, Jean Frédéric Myoupo, David Semé:
A Basis for 3-D Cellular Networks. ICOIN 2001: 631-636 - [c5]David Semé, Jean Frédéric Myoupo:
Efficient BSR-Based Parallel Algorithms for Geometrical Problems. PDP 2001: 265-272 - [c4]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)
1990 – 1999
- 1999
- [j4]Jean Frédéric Myoupo, David Semé:
Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems. J. Parallel Distributed Comput. 57(2): 212-223 (1999) - [j3]Emmanuel Delacourt, Jean Frédéric Myoupo, David Semé:
A Constant Time Parallel Detection of Repetitions. Parallel Process. Lett. 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 Process. Lett. 9(4): 539-550 (1999) - [c3]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 - [c2]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 Process. Lett. 8(4): 515-526 (1998) - 1996
- [c1]Jean Frédéric Myoupo, David Semé:
A single-layer systolic architecture for backpropagation learning. ICNN 1996: 1329-1333
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
