Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
CSR
2011
Springer
9 years 4 months ago
Improving the Space-Bounded Version of Muchnik's Conditional Complexity Theorem via "Naive" Derandomization
Abstract. Many theorems about Kolmogorov complexity rely on existence of combinatorial objects with speciļ¬c properties. Usually the probabilistic method gives such objects with b...
Daniil Musatov
EATCS
2002
141views more  EATCS 2002»
10 years 1 months ago
Recent Developments in Explicit Constructions of Extractors
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
Ronen Shaltiel
EATCS
2000
67views more  EATCS 2000»
10 years 1 months ago
Low-Discrepancy Sets For High-Dimensional Rectangles: A Survey
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...
A. Srinivasan
JCT
2006
81views more  JCT 2006»
10 years 1 months ago
Constructions of generalized Sidon sets
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...
Greg Martin, Kevin O'Bryant
CORR
2006
Springer
87views Education» more  CORR 2006»
10 years 1 months ago
Pseudorandomness and Combinatorial Constructions
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...
Luca Trevisan
DCC
2010
IEEE
10 years 1 months ago
On multiple caps in finite projective spaces
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,...
Yves Edel, Ivan N. Landjev
APPROX
2008
Springer
72views Algorithms» more  APPROX 2008»
10 years 3 months ago
Increasing the Output Length of Zero-Error Dispersers
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...
Ariel Gabizon, Ronen Shaltiel
COCO
2006
Springer
100views Algorithms» more  COCO 2006»
10 years 5 months ago
How to Get More Mileage from Randomness Extractors
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...
Ronen Shaltiel
FOCS
2009
IEEE
10 years 8 months ago
Constructing Small-Bias Sets from Algebraic-Geometric Codes
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
Avraham Ben-Aroya, Amnon Ta-Shma
books