Sciweavers

RSA
2006
91views more  RSA 2006»
13 years 10 months ago
Average case analysis of the Boyer-Moore algorithm
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...
Tsung-Hsi Tsai
RSA
2006
113views more  RSA 2006»
13 years 10 months ago
Applications of the regularity lemma for uniform hypergraphs
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...
Vojtech Rödl, Jozef Skokan
RSA
2006
62views more  RSA 2006»
13 years 10 months ago
Threshold values of random K-SAT from the cavity method
: Using the cavity equations of M
Stephan Mertens, Marc Mézard, Riccardo Zecc...
RSA
2006
96views more  RSA 2006»
13 years 10 months ago
Concentration inequalities for functions of independent variables
Following the entropy method this paper presents general concentration inequalities, which can be applied to combinatorial optimization and empirical processes. The inequalities g...
Andreas Maurer
RSA
2006
115views more  RSA 2006»
13 years 10 months ago
The counting lemma for regular k-uniform hypergraphs
Brendan Nagle, Vojtech Rödl, Mathias Schacht
RSA
2006
69views more  RSA 2006»
13 years 10 months ago
On smoothed analysis in dense graphs and formulas
: 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 ...
Michael Krivelevich, Benny Sudakov, Prasad Tetali
RSA
2006
98views more  RSA 2006»
13 years 10 months ago
Levels of a scale-free tree
Consider the random graph model of Barab
Zsolt Katona
RSA
2006
68views more  RSA 2006»
13 years 10 months ago
The probabilistic analysis of a greedy satisfiability algorithm
: 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...
RSA
2006
110views more  RSA 2006»
13 years 10 months ago
The degree sequences and spectra of scale-free random graphs
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...
Jonathan Jordan