How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model

From MaRDI portal
Publication:692907

DOI10.1007/s00224-011-9313-zzbMath1281.68049OpenAlexW2092232879MaRDI QIDQ692907

Shukai Cai, Koichi Wada, Taisuke Izumi

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9313-z




Related Items (16)



Cites Work


This page was built for publication: How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model