What Makes a Distributed Problem Truly Local? - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year :

What Makes a Distributed Problem Truly Local?


In this talk we attempt to identify the characteristics of a task of distributed network computing, which make it easy (or hard) to solve by means of fast local algorithms. We look at specific combinatorial tasks within the LOCAL model of distributed computation, and rephrase some recent algorithmic results in a framework of constraint satisfaction. Finally, we discuss the issue of efficient computability for relaxed variants of the LOCAL model, involving the so-called non-signaling property.
Fichier principal
Vignette du fichier
inv-kosowski-hal.pdf (75.52 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01415090 , version 1 (02-01-2017)



Adrian Kosowski. What Makes a Distributed Problem Truly Local?. SIROCCO 2016 - 23rd International Colloquium on Structural Information and Communication Complexity, Jul 2016, Helsinki, Finland. pp.3, ⟨10.1007/978-3-319-48314-6⟩. ⟨hal-01415090⟩
148 View
103 Download



Gmail Facebook Twitter LinkedIn More