David Semé

According to our database1, David Semé authored at least 32 papers between 1996 and 2007.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2007
Repetitions detection on a linear array with reconfigurable pipelined bus system.
Int. J. Parallel Emergent Distributed Syst., 2007

An Efficient Parallel Algorithm for the Longest Increasing Subsequence Problem on a LARPBS.
Proceedings of the Eighth International Conference on Parallel and Distributed Computing, 2007

An Efficient Sequence Alignment Algorithm on a LARPBS.
Proceedings of the Computational Science and Its Applications, 2007

2006
Work-efficient BSR-based parallel algorithms for some fundamental problems in graph theory.
J. Supercomput., 2006

Power-dependable transactions in mobile networks.
Proceedings of the 20th International Parallel and Distributed Processing Symposium (IPDPS 2006), 2006

A CGM Algorithm Solving the Longest Increasing Subsequence Problem.
Proceedings of the Computational Science and Its Applications, 2006

A Load Balancing Technique for Some Coarse-Grained Multicomputer Algorithms.
Proceedings of the 21st International Conference on Computers and Their Applications, 2006

2005
3D Hexagonal Network: Modeling, Topological Properties, Addressing Scheme, and Optimal Routing Algorithm.
IEEE Trans. Parallel Distributed Syst., 2005

A Coarse-Grained Multicomputer algorithm for the detection of repetitions.
Inf. Process. Lett., 2005

Parallel Algorithms for String Matching Problems on a Linear Array with Reconfigurable Pipelined Bus System.
Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

Computing the Longest Common Subsequence on a Linear Array with Reconfigurable Pipelined Bus System.
Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2004
Parallel Solutions of the Longest Increasing Subsequence Problem Using Pipelined Optical Bus Systems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

Parallel Solution of the Point Location Problem Using Pipelined Optical Bus Systems.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2004

A New Model for 3-D Cellular Mobile Networks.
Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004

Voronoï Mobile Cellular Networks: Topological Properties.
Proceedings of the 3rd International Symposium on Parallel and Distributed Computing (ISPDC 2004), 2004

2003
Optimal Routing Algorithm on Hexagonal Networks Based on a New Addressing Scheme.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

One-to-All Broadcasting in Voronoï Cellular Networks.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2003

A Coarse-Grained Multicomputer Algorithm for the Longest Common Subsequence Problem.
Proceedings of the 11th Euromicro Workshop on Parallel, 2003

A Coarse-Grained Multicomputer Algorithm for the Longest Repeated Suffix Ending at Each Point in a Word.
Proceedings of the Computational Science and Its Applications, 2003

2002
Optimal BSR Solutions to Several Convex Polygon Problems.
J. Supercomput., 2002

Exact Computations of the Longest Repeated Suffix Ending at Each Point in a Word.
Proceedings of the ISCA 17th International Conference Computers and Their Applications, 2002

2001
A work-optimal CGM algorithm for the LIS problem.
Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, 2001

Efficient BSR-Based Parallel Algorithms for Geometrical Problems.
Proceedings of the Ninth Euromicro Workshop on Parallel and Distributed Processing, 2001

A Basis for 3-D Cellular Networks.
Proceedings of the 15th International Conference on Information Networking, 2001

2000
Efficient Parallel Algorithms for the Lis and Lcs Problems on Bsr Model Using Constant Number of Selections.
Parallel Algorithms Appl., 2000

1999
A Constant Time Parallel Detection of Repetitions.
Parallel Process. Lett., 1999

All-to-All Broadcasting Algorithms on Honeycomb Networks and Applications.
Parallel Process. Lett., 1999

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems.
J. Parallel Distributed Comput., 1999

An Efficient Algorithm on the BSR-Based Parallel Architecture for the k-LCS Problem.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Star-Honey Meshes and Tori: Topological Properties, Communication Algorithms and Ring Embedding.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

1998
A One-Phase Parallel Algorithm for the Sequence Alignment Problem.
Parallel Process. Lett., 1998

1996
A single-layer systolic architecture for backpropagation learning.
Proceedings of International Conference on Neural Networks (ICNN'96), 1996


  Loading...