How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
From MaRDI portal
Publication:3587432
DOI10.1007/978-3-642-14162-1_10zbMath1288.68007OpenAlexW1864333249MaRDI QIDQ3587432
Dan Alistarh, Morteza Zadimoghaddam, Rachid Guerraoui
Publication date: 7 September 2010
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14162-1_10
Network design and communication in computer systems (68M10) Distributed systems (68M14) Network protocols (68M12)
This page was built for publication: How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange)
