Distributed computing with the Cloud

DOI10.1007/S00446-024-00460-WMaRDI QIDQ6126134zbMATH OpenOpenAlexFDO

Authors Yehuda Afek, Gal Giladi, Boaz Patt-Shamir

Publication date 9 April 2024

Published in Distributed Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s00446-024-00460-w

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cites work

• scientific article; zbMATH DE number 6297759 (Why is no real title available?)
• An introduction to Kolmogorov complexity and its applications
• Computing Shortest Paths and Diameter in the Hybrid Network Model
• Distributed Computing: A Locality-Sensitive Approach
• Lessons from the congested clique applied to MapReduce
• Locality in Distributed Graph Algorithms
• Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
• Modeling parallel bandwidth: Local versus global restrictions
• On a circle-cover minimization problem
• Parallel Prefix Computation
• Passing messages while sharing memory
• Quickest Flows Over Time
• Shortest Paths in a Hybrid Network Model
• The quickest flow problem
• Trade-offs between communication throughput and parallel time

Cited in

(2)

• A tight lower bound for 3-coloring grids in the online-LOCAL model
• Distributed hypothesis testing for large dimensional two-sample mean vectors

This page was built for publication: Distributed computing with the Cloud

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