Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
In this note we discuss several combinatorial problems that can be addressed by the Regularity Method for hypergraphs. Based on recent results of Nagle, Schacht and the authors, we...
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...
: We study a model of random graphs, where a random instance is obtained by adding random edges to a large graph of a given density. The research on this model has been started by ...
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...
Alexis C. Kaporis, Lefteris M. Kirousis, Efthimios...
We investigate the degree sequences of scale-free random graphs. We obtain a formula for the limiting proportion of vertices with degree d, confirming non-rigorous arguments of Do...