# Search results for: Jean Frédéric Myoupo

Parallel Computing > 2020 > 91 > C

Journal of Internet Services and Applications > 2018 > 9 > 1 > 1-15

IFIP — The International Federation for Information Processing > Mobile and Wireless Communication Networks > 287-298

The Journal of Supercomputing > 2012 > 61 > 3 > 463-480

*p*processors for the Optimal String Parenthesizing Problem or Minimum Cost...

The Journal of Supercomputing > 2010 > 52 > 2 > 135-148

The Journal of Supercomputing > 2006 > 38 > 1 > 83-107

*O*(

*N*

^{4}) processors. Here we show that these problems...

The Journal of Supercomputing > 2005 > 31 > 3 > 215-226

*n*items pretitled on a mobile ad hoc network (MANET for short) of

*p*stations (

*p*known) and

*k*channels (MANET{(

*n*,

*p*,

*k*)) with

*k*<

*p*, can be carried out in broadcast rounds if

*k*≤ √p and if each station has a $O(\frac{n}{k})$ -memory locations. And if

*k*≤ ...

The Journal of Supercomputing > 2002 > 21 > 1 > 77-90

*N*,

*M*) (where

*N*and

*M*are the number of edges of the two considered polygons), of processors for computing the maximum distance between two convex polygons, finding critical support lines of two convex polygons,...

Information Processing Letters > 1997 > 61 > 5 > 253-258

^{2}/2.

Information Processing Letters > 1997 > 61 > 3 > 129-136