scientific article; zbMATH DE number 7774261

DOI10.4230/LIPICS.DISC.2021.10MaRDI QIDQ6083370zbMATH OpenFDO

Authors Leonid Barenboim, Tzalik Maimon

Publication date 8 December 2023

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

zbMATH Keywords

complexity classdistributed computingsleeping model

Mathematics Subject Classification ID

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

Cited in

(5)

• The energy complexity of diameter and minimum cut computation in bounded-genus networks
• Energy-efficient distributed algorithms for synchronous networks
• Jamming-resistant backoff with polylogarithmic sending and listening cost
• A near-optimal low-energy deterministic distributed SSSP with ramifications on congestion and APSP
• Distributed MIS in O( n) awake complexity

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 Q6083370)