Join Our Newsletter
STACS
2012
Springer
11 years 7 months ago
2012
Springer
We consider the classical rumor spreading problem, where a piece of information must be disseminated from a single node to all n nodes of a given network. We devise two simple pus...
CSR
2011
Springer
12 years 3 months ago
2011
Springer
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...
CORR
2011
Springer
12 years 3 months ago
2011
Springer
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
