M. Ouali

most citedImproved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation

2 citations · 2 across the 2 of their papers we have counts for

collaborators

3 papers

math.AP2021

Generalized Nonlocal Robin Laplacian on Arbitrary Domains

Nouhayla Ait Oussaid, Khalid Akhlil, Sultana Ben Aadi +1

In this paper, we prove that it is always possible to define a realization of the Laplacian $Δ_{κ, θ}$ on $L^{2} (Ω)$ subject to nonlocal Robin boundary conditions with general jump me…

math.CO2021

Repeated randomized algorithm for the Multicovering Problem

Abbass Gorgi, Mourad El Ouali, Anand Srivastav +1

Let $H = (V, E)$ be a hypergraph with maximum edge size $ℓ$ and maximum degree $Δ$ . For given numbers $b_{v} \in N_{\geq 2}$ , $v \in V$ , a set multicover i…

cs.DS2013★ 2 cited

Improved Approximation Algorithm for the Number of Queries Necessary to Identify a Permutation

Mourad El Ouali, Volkmar Sauerland

In the past three decades, deductive games have become interesting from the algorithmic point of view. Deductive games are two players zero sum games of imperfect information. The…