Infinite networks, halting and local algorithms

zbMATH Open1467.68206arXiv1408.5963MaRDI QIDQ4995366FDOQ4995366

Authors: Antti Kuusisto 

Publication date: 24 June 2021

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

Recommendations

• Survey of local algorithms
• What Can be Computed Locally?
• Towards a complexity theory for local distributed computing
• What can be verified locally?
• Local Terminations and Distributed Computability in Anonymous Networks

Mathematics Subject Classification ID

Distributed algorithms (68W15) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (3)

• Constant space and non-constant time in distributed computing
• Emptiness problems for distributed automata
• Emptiness problems for distributed automata

This page was built for publication: Infinite networks, halting and local algorithms

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