Sciweavers

21 search results - page 1 / 5
» rsa 2011
Sort
View
RSA
2011
85views more  RSA 2011»
12 years 11 months ago
Piercing random boxes
Abstract. Consider a set of n random axis parallel boxes in the unit hypercube in Rd , where d is fixed and n tends to infinity. We show that the minimum number of points one nee...
Linh V. Tran
RSA
2011
92views more  RSA 2011»
12 years 11 months ago
Highly nonrepetitive sequences: Winning strategies from the local lemma
We prove game-theoretic versions of several classical results on nonrepetitive sequences, showing the existence of winning strategies using an extension of the Local Lemma which c...
Wesley Pegden
RSA
2011
102views more  RSA 2011»
12 years 11 months ago
Dependent random choice
: We describe a simple and yet surprisingly powerful probabilistic technique which shows how to find in a dense graph a large subset of vertices in which all (or almost all) small...
Jacob Fox, Benny Sudakov
RSA
2011
131views more  RSA 2011»
12 years 11 months ago
On covering by translates of a set
Abstract. In this paper we study the minimal number τ(S, G) of translates of an arbitrary subset S of a group G needed to cover the group, and related notions of the efficiency of...
Béla Bollobás, Svante Janson, Oliver...