What can be verified locally?
type: Item
instance of: scholarly article
title: What can be verified locally?
zbMATH Open document ID: 1398.68167
author: Alkida Balliu
author: Gianlorenzo D'Angelo
author: Pierre Fraigniaud
author: Dennis Olivetti
published in: Journal of Computer and System Sciences
publication date: 2018-09-07T00:00:00Z
full work available at URL: https://aaltodoc.aalto.fi/handle/123456789/35266
Mathematics Subject Classification ID: 68Q10
zbMATH DE Number: 6934101
zbMATH Keywords: distributed computing
zbMATH Keywords: decision problems
zbMATH Keywords: local model
MaRDI profile type: Publication
OpenAlex ID: W2885668823
cites work: Q4967211
cites work: Q4598260
cites work: What can be decided locally without identifiers?
cites work: On the Impact of Identifiers on Local Decision
cites work: Towards a complexity theory for local distributed computing
cites work: Locally checkable proofs
cites work: Proof labeling schemes
cites work: What cannot be computed locally!
cites work: Leveraging Linial’s Locality Limit
cites work: Locality in Distributed Graph Algorithms
cites work: What Can be Computed Locally?
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: Distributed Graph Automata
cites work: Survey of local algorithms
Wikidata QID: Q129395629
DOI: 10.1016/J.JCSS.2018.05.004
description: scientific article; zbMATH DE number 6934101