Is there a natural graph function that distinguishe non-isomorphic graphs?

Hard-core predicate and list decoding

Chance-constrained problems and rare events: an importance sampling approach.

First passage percolation and escape strategies

On the metric dimension for random graphs

Exponential Familia Techniques for the Lognormal Left Tail

The Generalized Riemann problem as a building block for high-order finite volume methods

Strict majority bootstrap percolation on augmented rings, tori and random regular graphs.

The Generalized Riemann problem as a building block for high-order finite volume methods}

The usefulness of calmness in optimization