1434 search results - page 15 / 287 » Distributed Computing with Imperfect Randomness |
FSTTCS
2009
Springer
14 years 2 months ago
2009
Springer
We clarify the role of Kolmogorov complexity in the area of randomness extraction. We show that a computable function is an almost randomness extractor if and only if it is a Kolm...
ICPP
1995
IEEE
13 years 11 months ago
1995
IEEE
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...
WDAG
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
The paper presents how the Random PROLOG Processor (RPP), a bio-inspired model of computations, can be used for formalization and analysis of a phenomenon - the Collective Intelli...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM