J.
F. Myoupo, V. Kengne Tchendji, An Efficient Coarse-Grain
Multicomputer Algorithm for the Minimum Cost Parenthesizing
Problem. To appear in Journal
of Supercomputing
S. Faye, J. F. Myoupo, Secure and energy-efficient
geocast protocols for wireless sensor networks based on a
hierarchical Clustered structure. To appear in International Journal of Network
Security
2011
Faye, J. F. Myoupo, An Ultra
Hierarchical Clustering-Based Secure Aggregation Protocol for
Wireless Sensor Networks, Advances
in Information Sciences and Service Sciences (AISS),
Vol.3, no 9, pp. 309-319, 2011, pdf
Lakhlef, A. Bomgni et J. F.
Myoupo, An Efficient Permutation Routing Protocol in Multi-Hop
Wireless Sensor Networks. International Journal of Advancements in Computing
Technology (IJACT) Vol. 3, Number 6, pp. 207-214, J
2011, pdf
A. Ould Tcheikhna, J. F. Myoupo, A Partial Sorting
Algorithm in Multi-Hop Wireless Sensor Networks, International Conference on
Wireless Networks (ICWN'11), pp. 68-74, 2011, pdf
H. Lakhlef, J. F. Myoupo, Secure
permutation routing protocol in multi-hop wireess sensor
networks, International
Conference on Security and Management (SAM'11), pp.
691-696, 2011, pdf
S. Faye, J. F. Myoupo, Deployment
of Sparse Sensor-Actuator Network in a Virtual
Architecture,
International Conference on Wireless Networks (ICWN'11),
126-134, 2011, pdf
2010
J. F. Myoupo, A. Ould Cheikhna and I. Sow; A Randomized
Clustering of Anonymous Wireless Ad Hoc Networks With an
Application to the Initialization Problem. Journal of Supercomputing,vol
52, p 135-148, 2010
A. B. Bomgni & J.F. Myoupo.
An Energy-Efficient Clique-Based Geocast Algorithm for
Dense Sensor Networks. Communications
and Networks, vol.2 pp. 125-133, 2010
L. Fotso, V. Kengne Tchendji and J. F. Myoupo
Myoupo. Load Balancing for Parallel
Processing of Dynamic Programming on BSP/CGM Model. Intern. Conf. Parall. Distr. Process. Technique
and Applications (PDPTA’2010)
A. B. Bomgni & J.F. Myoupo.
A Deterministic Protocol for Permutation Routing in Dense
Multi-hop Sensor Networks. Wireless Sensor Network vol.2 pp. 293-299, 2010,
pdf
D.
Benferhat and J.F. Myoupo. A Physical DPT and Regional
CSP-Based Hybrid Algorithm for Energy Efficiency in Target
Tracking in Wireless Sensor Networks. International Conference on
Networks (ICN'10),
p. 127-132, 2010
A. J. F. Myoupo and A.
Ould Cheikhna. On the performance of a Hierarchical
Clustering Based-Geocast Algorithm in Wireless Sensor Networks
with Guaranteed Delivery. Intern. Conf. on Sensor
Technology and Applications, SENSORCOMM’10, p. 250-255, 2010
2009
M. Kechid & J.F. Myoupo. A Coarse-Grain
Multicomputer Algorithm for the Minimum Cost Parenthesization
Problem. Intern. Conf.
Parall. Distr. Process. Technique and Applications
(PDPTA'2009), vol. 2, p. 480-486,
A. B. Bomgni, J. F. Myoupo and A. Ould Cheikhna.
Randomized Multi-stage Clustering-Based Geocast Algorithms in
Anonymous Wireless Sensor Networks. The 5th IEEE/ACM International Wireless
Communications and Mobile Computing Conference (IWCMC2009),
pp. 286-291, 2009
J.F. Myoupo, M. Naimi & O. Thiare. Clustering Group
Mutual Exclusion Algorithm For Mobile Ad Hoc. IEEE Symposium on Computers and
Communications (ISCC'09) pp. 693-696, 2009.
2008
J.F. Myoupo & I. Sow. Clustering in Mobile Ad Hoc
Networks With Some Nodes Having the Same Weight, Studia Informatica Universalis vol.
6, pp. 1-13, 2008,
Rahma Ben Ayed, Abderrahmen Guermazi &
Jean-Frédéric Myoupo. Vers un protocole de
routage efficace et sécurisé pour les
réseaux de capteurs sans fil hiérarchiques
distribués. The
Third International Conference on Risks and Security of
Internet and Systems (CRiSIS 2008), Tunisia, October 28-30, 2008,
M. Kechid & J.F. Myoupo. An Efficient BSP/CGM
Algorithm for the Matrix Chain Ordering Problem. The 2008 International
Conference on Parallel and Distributed Processing Techniques
and Applications (PDPTA'08), vol.1, p. 327-332,
J.F. Myoupo & I. Sow. Data Gathering in a Virtual
Architecture for Wireless Sensor Networks With Some Empty
Clusters. The 2008
International Conference on Wireless Networks (ICWN'08),
vol.1, p. 75-81,
D. Karimou, J.F. Myoupo & H. Saliah-Hassane. A
Cluster-Based Distributed Scheme for Intrusion Control in
Mobile Ad Hoc Networks. The
2008 International Conference on Wireless Networks (ICWN'08),
vol.1, p. 488-493,
M. Kechid & J.F. Myoupo. A Coarse Grain
Multicomputer Algorithm Solving the Optimal Search Binary Tree
Problem. Proc. 5th
International Conference on Information Technology:New
Generations (ITNG 2008), p. 1186-1189,
N. Hadid & J.F. Myoupo. Multi-Geocast Algorithms
for Wireless Sparse or Dense Ad Hoc Sensor Networks. Fourth International Conference
on Networking and Services,( ICNS 2008). P.35-39, 2008.
2007
M. Bui, J. F. Myoupo & Idrissa Sow. An Operationnal
Model for Mobile Target Tracking in Wireless Sensor Networks.
ISWPC,2007
J.F. Myoupo & I. Sow. Self-localization and
connectivity maintenance scheme for target tracking in
wireless sensor networks. The Seventh IASTED International
conference on wireless and optical communications WOC 2007. p. 343-348, May 30-june 1
2007, Montreal, Canada.
2006
.F. Myoupo and D. Seme . Work-efficient-based parallel
algorithms for some fundamental problems in graph theory. Journal
of Supercomputing,
vol. 38, p. 83-107, 2006.
A.
Idrissi, C. M. Li and J.F. Myoupo. An Algorithm for a
constraint optimization problem in mobile ad hoc networks. P:
555-562.ICTAI
2006: 555-562.
Karimou,
D., Myoupo, J.F., 2006, Randomized Permutation Routing
Algorithm in Multi-Hop Ad Hoc Networks with Unknown
Destinations, in International Federation for Information
Processing (IFIP), Volume 212, Ad-Hoc Networking, ed. Al
Agha, K., (Boston: Springer), pp. 47-59
R. Mellier, J.F. Myoupo. A weighted clustering
algorithm for mobile ad hoc networks with non unique weights .
ICWMC: 2006: p. 39
R. Mellier, J.F. Myoupo and I. Sow. GPS-Free Geocasting
algorithms in Mobile Ad Hoc Networks.ICWMC:
2006: p. 38
R. Mellier, J.F. Myoupo & V. Ravelomanana. A
distributed mutual exclusion algorithm for single-hop ad hoc
mobile networks. IFIP
International Federation for Information Processing vol.
162, pp.287-298, 2005,
D. Karimou & J.F. Myoupo. An Application of an
Initialization Protocol to Permutation Routing in a Single Hop
Mobile Ad Hoc Network. Journal of Supercomputing, 31(3), p.
215-226, 2005,
J.F. Myoupo & Idrissa Sow. A Robot-Walk-Based
Collaborative Algorithm for Target Tracking in Ad Hoc Sensor
Networks. IEEE International
Conference on Networks (ICON2005), pp. 451-456, IEEE
Press,
Romain Mellier & J.F. Myoupo. A clustering mutual
exclusion protocol for multi-hop mobile ad hoc Networks. IEEE International Conference on
Networks (ICON 2005), pp. 250-255, IEEE Press,
Mounir Kechid & J.F. Myoupo. Towards a more
realistic BSP cost model. 8th
International Conference on High Performance Computing in
Asia-Pacific Region HPC-Asiapp. 3-12, 2005, Beijing, China,
R. Mellier & J.F. Myoupo. A Mobility-Management
Mechanism for Broadcasting in Unknown Mobile Ad Hoc Networks.
2nd ACM Workshop on
Performance Evaluation of Wireless Ad Hoc, Sensor, and
Ubiquitous Networks (PE-WASUN' 2005), pp. 242-245,
Montreal, Qc. Canada, October 10-13, 2005,
D. Karimou & J.F. Myoupo. An Energy-Saving
Algorithm for Initialization in Single-hop Mobile Ad Hoc
Networks. Advanced
Industrial Conference on Wireless Technologies, ICW2005 ,pp.
153-158,
IEEE
Press, Montreal, Canada, 2005,
R. Mellier & J.F. Myoupo. An Implementation of an
Energy-Saving Mutual Exclusion Protocol for Mobile Ad Hoc
Networks. 2005
International Conference on Wireless Networks (ICWN'05),
pp.341-347 2005, Las Vegas, USA),
D. Karimou & J.F. Myoupo. A Fault Tolerant
Permutation Routing Algorithm in Mobile Ad Hoc Networks. International Conference on
Networks (ICN'05), LNCS Part II, 3421, pp. 107-115,
2005,
D. Karimou & J.F. Myoupo. Markov Chain
Based-Protocols for Dynamic Initialization of Single-Hop Ad
Hoc Mobile Networks. International
Conference on Parallel and Distributed Computing and
Networks, PDCN. 456-024, p.38-43 Innsbruck, Austria, 2005.
T. Garcia, J.F. Myoupo and D. Seme. A Coarse- Grained
Multicomputer Algorithm for the Longesty Common Subsequence
Problem. Euromicro Workshop
on Parallel and Distributed Processing,(PDP20003), pp.
349-356, 2003
J.F. Myoupo, V. Ravelomanana & L. Thimonier.
Average Case Analysis Based-Protocols to Initialize Packet
Radio Networks. Journal of
Wireless Communication and Mobile Computing,vol.
3, 539-548, 2003.
J.F. Myoupo. Concurrent Broadcasts-Based Permutation
Routing algorithms in Radio Networks, 8th IEEE International Symposium
on Computers and Communications, ISCC'03, pp.
1272-1276, 2003
J.F. Myoupo. Dynamic Initialization protocols for
mobile ad hoc networks.11th
IEEE International Conference on Networks (ICON2003), Sydney,
Australia, pp. 149-154, 2003.
J.F. Myoupo, H.B. Ndamas and D. Seme. Hexagonal Mesh : A
New Addressing Scheme and an Optimal Routing Algorithm. AI,
2002, Innsbruck, Austria,
T. Lecroq, J.F. Myoupo and D. Seme. Exact Computations
of the Longest Repeated Suffix Ending at Each Point in a Word.
CATA'2002,
A. Bouabdallah, J.F. Myoupo & D. Seme. An Efficient
All-To-All Communication Protocol in Honeycomb Networks. Intern. Symp. on Performance
Evaluation of Computers and Telecommunications Systems,
July 14-18, San Diega, pp.908-915, 2002
J.F. Myoupo, David Seme and Ivan Stojmenovic. Optimal
BSR Solutions to Several Convex Polygon Problems. Journal of Supercomputing vo.21,
pp. 77-90, 2002
J.F. Myoupo et D.
Semé. An Optimal Parallel Solution for a Geometrical
Matching Problem Using BSR Model. Intern. Conf. Parall. Distr. Process. Technique and
Applications (PDPTA’2001), pp.556-562, 2001
T. Garcia, J.F. Myoupo et D.
Semé. A work-Optimal CGM Algorithm for the Longest
Increasing Subsequence Problem. ACM SPAA’200,
PP.563-569, 2001
J. Carle, J.F.
Myoupo et D. Semé. A Basis for 3-D Cellular Networks, 15th Intern. Conf. on Information Networking
(ICOIN-15). pp. 631-636, Jannuary 31-February 2, 2001, Beppu City, Japan.IEEE Press.
J.F. Myoupo, D.
Semé. Efficient BSR-Based Parallel Algorithms for
Geometrical Problems. 9th
Euromicro Workshop on Parallel and Distributed Processing,
(PDP20001), Bibiena Academic Scientific
Theatre of Mantova,
Italy
February 7th-9th, 2001. IEEE Press
J. Carle, J.F.
Myoupo et I. Stojmenovic. Higher
Dimensional Honeycomb Networks . Journal of
Interconnection Networks, vol. 2, N°4, 2001,
pp.391-420.
J.F. Myoupo a A. Wabbi. Move-to-front and transpose
hybrid parallel architectures for high-speed data compression.
IPCCC 2000: 67-73, 2000
J. Carle, J.F.
Myoupo. Collision
Detection
Based-Deterministic Protocols for Dynamic Inialization of
Radio Networks. ISCA
Intern. Conf. Parall. Distr. Computt. systems,
pp. 159-164. Las Vegas, USA, 2000.
J. Carle, J.F. Myoupo. Topological properties
and Optimal Routing Algorithms for Three dimensional Hexagonal
Networks. The IEEE Fourth
International Conference on High Performance Computing in
Asia-Pacific Region (HPC-ASIA’2000), Beijing,
China, 2000, vol.1, pp.116-120. IEEE Press,
2000
J.F. Myoupo et D. Semé. Efficient Parallel
Algorithms for the LIS and LCS Problems on BSR ModelUsing
Constant Number of Selections.Journal of
Parallel Algorithms and Applications. vol. 14, pp.
187-202, 2000.
J.F.
Myoupo. A Dynamic Initialization of Radio Networks, Proc. IASTED Intern. Conf.
Parall. Distr. Computt. systems, PDCS’99, PP.907-1001,
Massachussetts Institute of Technilogy (MIT), pp. 997-1001,
Boston, 1999.
J. Carle, J.F. Myoupo et D.
Semé. Star-Honeycomb Meshes and Tori: Topological
Properties, Communications Algorithms, and Ring Embedding,(OPODIS’99) Special
Issue of STUDIA INFORMATICA UNIVERSALIS,pp.85-108,
1999.
J.F. Myoupo et D.
Semé. Time-Efficient Algorithms for the Longest Common
Subsequence and Related Problems. Journal of Parallel and
Distributed Computing, Vol. 57, 212-223, 1999.
E. Delacourt, J.F. Myoupo et D.
Semé. A Constant Time Parallel Detection of
Repetitions. Parallel Processing LettersVol.
9, pp. 81-92, 1999.
J. Carle, J.F. Myoupo et D.
Semé. All-to-All Broadcasting Algorithms on Honeycomb
Networks and Applications. Parallel Processing Letters vol. 9, N°4, 1999,
pp. 539-550
G.Luce,
J.F.
Myoupo
et
A.
Wabbi.
A
3-D Systolic Array for Computing the Length of a Longest Common
Subsequence of Four Sequences. Proc. 11th ISCA International Conference on Computer
Applications in Industry and Engineering, (CAINES'98),
pp. 188-191 Las
Vegas, 1998.
J.F. Myoupo.
Permutation Routing, Ranking and Sorting Algorithms on the
Coarse-Grain Broadcast Communication Model With Few Channels.
Proc. IASTED Intern. Conf.
Parall. Distr. Computt. systems, PDCS’98,
PP.45-50,Las Vegas,
1998.
J.F.
Myoupo, D. Semé. A Parallel Solution of the the
Sequence Alignment using BSR Model. ISCA Intern. Conf. Parall. Distr. Computt. systems,PP. 357-362, New Orleans, USA, 1998.
G. Luce et J.F. Myoupo. Application-Specific
Array Processors for the Longest Common Subsequence Problem of
Three Sequences.Journal of Parallel Algorithms and Applications, vol. 13, pp.27-52, 1998.
G. Luce et J.F. Myoupo. Systolic-Based Parallel
Architecture for the Longest Common Subsequences Problem. INTEGRATION: The VLSI Journalvol. 25,
1998, pp. 53-70.
T.
Lecroq, J.F. Myoupo et D. Semé. A one-Phase Parallel
Algorithm for the Sequence Alignment Problem.Parallel Processing
Letters LettersVol. 8, N° 4,
pp. 515-526, 1998.
G. Luce, J.F.
Myoupo. Efficient parallel computing of the length of a
longest common subsequence of three strings. Proc. 8th SIAM Conference on Parallel
Processing for Scientific Computing.Minneapolis, USA March
1997
J.F. Myoupo et A. Wabbi. Designing Multiprocessor
array Architecture for High-Speed Data Compression Using
Static Huffman Codes. IEEE
Intern. Conf. on Electronic Circuits and Systems; Cairo,
Egipt, pp. 324-328. IEEE Press, 1997.
J.F. Myoupo et
A. Wabbi. Improved
linear
systolic algorithms for substrings stattistics. Information Processing
Letters . Vol. 61
(5), 1997, pp. 253-258.
T. Lecroq, G. Luce
et J.F. Myoupo A Faster Linear Systolic Algorithm Recovering a
Longest Common Subsequence.Information
Processing Letters. Vol. 61 (3), 1997, pp. 129-136.
.
J.F. Myoupo,
A. Wabbi. Improved Systolic Architecture for Transpose
Heuristic.Proc. ISCA Intern. Conf. Parall.
Distr. Comput.Dijon, France,
sept. 1996. pp. 64-68.
J.F. Myoupo et
A.C. Fabret. Modular
Systolic Linearization of the Warshall-Floyd Algorithm. IEEE Transactions
on Paralleland Distributed
Systems , Vol. 7, N°
5, 1996 . pp. 449-455.
G. Luce and J.F. Myoupo. An efficient linear systolic
algorithm for recovering longestcommon subsequences. IEEE ICA3PP, Vol. 1, p. 20-29, 1995
.
C. Cérin, J.F. Myoupo.
Parallel
Solutions for the Maximum-Segment-Sum Problem. SIAM Conference on Discrete
Mathematics, Alburquerque, New
Mexico, June, 1994.
C. Cérin,
J.F. Myoupo. On a Systolic Solution of the Longest Increasing
Subsequence Problem and its Implementation.International
Conf. on Parallel Computing (PARCO’93), Université de Grenoble, 1993.
C. Cérin, J.F. Myoupo. Geometric Based
Methodology for Synthesizing Linear Systolic Arrays from the
Winograd's Algorithm. International
Conference on Parallel Computing Technologies, (PACT-93),Obninsk,
Russia,
August-September 1993.
C. Goutte, J.F.
Myoupo et V. Pau. Simulation of Radiation Calculation
Algorithms on CRAY Supercomputers.SIAM Conf. on Simulation and Monte
Carlo Methods, August 1993, San Francisco, California.
J.F. Myoupo.
Mapping Dynamic Programming onto Modular Linear Systolic
Arrays. Distributed
Computingvol. 6 (3), 1993, pp.
165-179.
J.F. Myoupo. Solving Dynamic Programming Problems
Efficiently on Modular Linear Pipelines.IPCCC 2002, April 1-3, 1992, Scottdale,
Arizona, IEEE Press; pp. 87-92.
A. C. Fabret et J.F. Myoupo.
Designing
Modular Linear Systolic Arrays Using Dependence Graph Regular
Partitionn. 2nd Joint. International Conference on Vector and
Parallel Processing, Lyon, France in Lectures
Notes in Computer Science, vol. 634, pp.265-270,1992.
J.F. Myoupo.
Synthesizing Linear systolic Arrays for Dynamic Programming
Problems. Parallel
Processing Letters, Vol.2, N°1, 1992; pp.97-110
Jean
Frédéric Myoupo: Corrigenda: Dynamic Programming
on Linear Pipelines. Inf.
Process. Lett. 41(5): 289 (1992)
J.F. Myoupo. A Way
of Deriving Linear Systolic Arrays from a Mathematical Algorithm Description: Case of the
Wharshall-Floyd Algorithm. Proceedings of the 1991
International Conference on Parallel Processing" (ICPP), Vol. 1;
pp. 575-579, 1991
J. F. Myoupo. A
Fully-Pipelined Solutions Constructor for Dynamic Programming
Problems. International
Conference on Computing and Information, Ottawa,
in Lectures Notes in Computer Science, vol. 497, pp.421-430, 1991
J.F. Myoupo.
Dynamic Programming on Linear Pipelines. Information
Processing Letters, 39 (Sept. 1991); pp.333-341.
J. F. Myoupo. Dynamic programming on linear
systolic arrays. Proceedings
of the 28th Annual Allerton Conference on
Communication, Control and Computing, Allerton House,
Montecillo, Illinois,p.254-261,Oct. 3-5
1990
J. F. Myoupo. A
linear Systolic Array for Transitive Closure Problems. Proceedings
of
the 1990 international Conference on Parallel Processing
(ICPP),.
B. Wah Editor, Volume 1, The PennsylvaniaStateUniversity
Press; pp. 617-618, 1990
J. F. Myoupo.
Transitive closure and matrix product on modular linear
systolic arrays. Proceedings
of the 10th international Conference of the Chilean Computer
Society. Santiago, Chile. pp. 275-287, 1990
C. Mira and J.F. Myoupo. Chaînes de Bifurcations donnant
Naissance à des Courbes Fermées Invariantes
Cycliques pour un Difféomorphisme Cubique
Bidimensionnel.C.R.
Acd. Sc. Paris, t. 299, série 1,
n°4, 1984.
J. F. Myoupo.
Quelques Remarques sur la Structure
des Bifurcations du Difféomorphisme du Cercle. C.R. Acad. Sc.
Paris, t. 299, série 1, n°18, 1984