Models of smoothing in dynamic networks

DOI10.4230/LIPICS.DISC.2020.36MaRDI QIDQ6535035zbMATH OpenFDO

Authors Uri Meir, Ami Paz, Gregory Schwartzman

Publication date 2 November 2023

Full work available at URL https://doi.org/10.4230/LIPICS.DISC.2020.36

zbMATH Keywords

smoothed analysisfloodingdistributed dynamic graph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• Smoothed analysis. Motivation and discrete models
• Smoothed Analysis of Leader Election in Distributed Networks
• Randomized smoothing networks

Cites work

• An introduction to temporal graphs: an algorithmic perspective
• Coordinated consensus in dynamic networks
• Distributed computation in dynamic networks
• Fast space optimal leader election in population protocols
• Faster information dissemination in dynamic networks via network coding
• On the Complexity of Distributed Splitting Problems
• On the complexity of information spreading in dynamic networks
• Polynomial counting in anonymous dynamic networks with applications to anonymous dynamic algebraic computations
• Probability and Computing
• Random Walks on Randomly Evolving Graphs
• Smoothed analysis of algorithms
• The cost of radio network broadcast for different models of unreliable links
• Towards robust and efficient computation in dynamic peer-to-peer networks

Cited in

(5)

• Estimating network edge probabilities by neighbourhood smoothing
• scientific article; zbMATH DE number 5233442 (Why is no real title available?)
• The impact of randomization in smoothing networks
• Smoothing processes and adaptation in models of collective behavior
• Smoothed analysis of information spreading in dynamic networks

This page was built for publication: Models of smoothing in dynamic networks

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