Mourad el Ouali

Mathematiker, Mathematiker

Has participated in:

Randomized Approximation for the Matching and Vertex Cover Problem in Hypergraphs: Complexity and Algorithms
Randomized approximation for the matching and vertex cover problem in hypergraphs : complexity and algorithms
The Exact Query Complexity of Yes-No Permutation Mastermind
On the Query Complexity of Black-Peg AB-Mastermind

All Objects (4)

External links:

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Mourad el Ouali

Has participated in:

External links:

Reset password