Abstract. We present a distributed algorithm for environmental monitoring of a scalar field (such as temperature, intensity of light, atmospheric pressure, etc.) using a random se...
The creation and growth of components of a given complexity in a random graph process are studied. In particular, the expected number and total size of all such components is found...
This paper puts forward a new notion of a proof based on computational complexity and explores its implications for computation at large. Computationally sound proofs provide, in a...
Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references ...
Gibbs random eld model with multiple pairwise pixel interactions describes each type of spatially homogeneous image textures in terms of a pixel neighbourhood and Gibbs potentials...