On space complexity of self-stabilizing leader election in mediated population protocol
type: Item
instance of: scholarly article
title: On space complexity of self-stabilizing leader election in mediated population protocol
zbMATH Open document ID: 1257.68038
author: Ryu Mizoguchi
author: Hirotaka Ono
author: Shuji Kijima
author: Masafumi Yamashita
published in: Distributed Computing
publication date: 2013-02-04T00:00:00Z
Mathematics Subject Classification ID: 68M14
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 6134284
zbMATH Keywords: population protocols
zbMATH Keywords: mediated population protocols
zbMATH Keywords: leader election
zbMATH Keywords: self-stabilization
zbMATH Keywords: space complexity
MaRDI profile type: Publication
full work available at URL: s00446-012-0173-9
OpenAlex ID: W2071135260
cites work: Computation in networks of passively mobile finite-state sensors
cites work: Fast computation by population protocols with a leader
cites work: Q3396623
cites work: Self-stabilizing counting in mobile sensor networks
cites work: How to prove impossibility under global fairness: on space complexity of self-stabilizing leader election on a population protocol model
cites work: Mediated population protocols
cites work: Recent Advances in Population Protocols
cites work: Self-stabilizing systems in spite of distributed control
cites work: Q4446603
cites work: Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
DOI: 10.1007/S00446-012-0173-9
description: scientific article; zbMATH DE number 6134284