CSR
2011
Springer
12 years 10 months ago
2011
Springer
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with specific properties. Usually the probabilistic method gives such objects with b...
EATCS
2002
13 years 6 months ago
2002
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
EATCS
2000
13 years 6 months ago
2000
A sub-area of discrepancy theory that has received much attention in computer science recently, is that of explicit constructions of low-discrepancy point sets for various types o...
JCT
2006
13 years 6 months ago
2006
We give explicit constructions of sets S with the property that for each integer k, there are at most g solutions to k = s1 + s2, si S; such sets are called Sidon sets if g = 2 a...
CORR
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
DCC
2010
IEEE
13 years 6 months ago
2010
IEEE
In this paper, we consider new results on (k, n)-caps with n > 2. We provide a lower bound on the size of such caps. Furthermore, we generalize two product constructions for (k,...
APPROX
2008
Springer
13 years 8 months ago
2008
Springer
Let C be a class of probability distributions over a finite set . A function D : {0, 1}m is a disperser for C with entropy threshold k and error if for any distribution X in C s...
COCO
2006
Springer
13 years 10 months ago
2006
Springer
Let C be a class of distributions over {0, 1}n . A deterministic randomness extractor for C is a function E : {0, 1}n {0, 1}m such that for any X in C the distribution E(X) is sta...
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
We give an explicit construction of an -biased set over k bits of size O k 2 log(1/ ) 5/4 . This improves upon previous explicit constructions when is roughly (ignoring logarith