Average and Randomized Complexity of Distributed Problems

DOI10.1137/S0097539793252432MaRDI QIDQ5691293zbMATH OpenFDO

Authors Nechama Allenberg-Navony, Alon Itai, Shlomo Moran

Publication date 9 June 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539793252432

zbMATH Keywords

randomized algorithmsdecision-tree model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• On the average communication complexity of asynchronous distributed algorithms
• Lower bounds on communication complexity in distributed computer networks
• Average and randomized communication complexity

Cited in

(7)

• Stochastic analysis of average-based distributed algorithms
• Average and randomized communication complexity
• The complexity landscape of distributed locally checkable problems on trees
• Hundreds of impossibility results for distributed computing
• New classes of distributed time complexity
• On the average communication complexity of asynchronous distributed algorithms
• On the average time complexity of computation with random partition

This page was built for publication: Average and Randomized Complexity of Distributed Problems

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