scientific article; zbMATH DE number 7774256

DOI10.4230/LIPICS.DISC.2021.5MaRDI QIDQ6061689zbMATH OpenFDO

Authors Ioannis Anagnostides, Themis Gouleakis

Publication date 8 December 2023

Full work available at URL https://arxiv.org/abs/2108.01740

zbMATH Keywords

all-pairs shortest pathsdeterministic algorithmsdistributed computinghybrid modelminimum cutradiussparse graphs

Mathematics Subject Classification ID

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

Cited in

(3)

• Optimal lower bounds for some distributed algorithms for a complete network of processors
• Polylogarithmic-time deterministic network decomposition and distributed derandomization
• Universally optimal information dissemination and shortest paths in the HYBRID distributed model

This page was built for publication:

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