- Full text PDF available (7)
- This year (1)
- Last 5 years (4)
- Last 10 years (7)
Journals and Conferences
We study variants of the α-synchronizer by Awerbuch (J. ACM, 1985) within a distributed message passing system with probabilistic message loss. The purpose of synchronizers is to maintain a virtual (discrete) round structure. Their idea essentially is to let processes continuously exchange round numbers and to allow a process to proceed to the next round… (More)
A strategy to increase an algorithm’s robustness against internal memory corruption is to let processes actively discard part of their accumulated knowledge during execution. We study how different strategies of forgetting affect the performance of a synchronizer in an environment with probabilistic message loss. Introduction. Network synchronizers allow to… (More)
We consider Kemp’s q-analogue of the binomial distribution. Several convergence results involving the classical binomial, the Heine, the discrete normal, and the Poisson distribution are established. Some of them are q-analogues of classical convergence properties. From the results about distributions, we deduce some new convergence results for… (More)
We consider the q-deformed binomial distribution introduced by Jing 1994 and Chung et al. 1995 and establish several convergence results involving the Euler and the exponential distribution; some of them are qanalogues of classical results.
We extend Baire results about nα-sequences in different ways, in particular we investigate sequences with multidimensional indices.
We introduce a family of q-analogues of the binomial distribution, which generalises the Stieltjes-Wigert-, Rogers-Szegö-, and Kemp-distribution. Basic properties of this familiy are provided and several convergence results involving the classical binomial, Poisson, discrete normal distribution, and a family of q-analogues of the Poisson distribution are… (More)
Broadcasting and convergecasting are pivotal services in distributed systems, in particular, in wireless ad-hoc and sensor networks, which are characterized by timevarying communication graphs. We study the question of whether it is possible to disseminate data available locally at some process to all n processes in sparsely connected synchronous dynamic… (More)