Martin Zeiner

  • Citations Per Year
Learn More
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 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)
  • 1