Smoothed analysis of dynamic networks

DOI10.1007/S00446-017-0300-8MaRDI QIDQ6830203zbMATH OpenFDO

Authors Michael Dinitz, Jeremy T. Fineman, Seth Gilbert, Calvin Newport

Publication date 13 August 2018

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00446-017-0300-8

zbMATH Keywords

aggregationdistributed algorithmsdynamic networksfloodingrandom walkssmoothed analysis

Mathematics Subject Classification ID

Random walks on graphs (05C81) Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Cited in

(2)

• Smoothed analysis of information spreading in dynamic networks
• Memory lower bounds and impossibility results for anonymous dynamic broadcast

This page was built for publication: Smoothed analysis of dynamic networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6830203)