What Makes a Distributed Problem Truly Local? - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

What Makes a Distributed Problem Truly Local?

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

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

Identifiants

Citer

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⟩
159 Consultations
106 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More