Distributed decision problems: the locality angle

Authors:
Shay Kutten
Affiliations:
Faculty of IE&M, Technion, Haifa, Israel
Venue:
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Year:
2011

Citing 25
Cited 0

Optimal distributed algorithms for minimum weight spanning tree, counting, leader election, and related problems

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
Wait-free synchronization

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Competitive distributed job scheduling (extended abstract)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Locality in distributed graph algorithms

SIAM Journal on Computing
Verification and sensitivity analysis of minimum spanning trees in linear time

SIAM Journal on Computing
Contention in shared memory algorithms

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
What can be computed locally?

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Impossibility of distributed consensus with one faulty process

Journal of the ACM (JACM)
The weakest failure detector for solving consensus

Journal of the ACM (JACM)
The local detection paradigm and its applications to self-stabilization

Theoretical Computer Science
A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees

SIAM Journal on Computing
Fast distributed construction of small k-dominating sets and applications

Journal of Algorithms
The topological structure of asynchronous computability

Journal of the ACM (JACM)
Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge

SIAM Journal on Computing
A Distributed Algorithm for Minimum-Weight Spanning Trees

ACM Transactions on Programming Languages and Systems (TOPLAS)
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
What cannot be computed locally!

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Proof labeling schemes

Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On the complexity of distributed graph coloring

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Distributed verification of minimum spanning trees

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Consensus in the presence of partial synchrony (Preliminary Version)

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Distributed computational complexities: are you volvo-addicted or nascar-obsessed?

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The aim of this invited talk is to try to stimulate research in the interesting and promising research direction of distributed verification. This distributed bears some similarities to the task of solving decision problems in the context of sequential computing. There, the study of decision problems proved very fruitful in establishing structured foundations for the theory. There are some signs that the study of distributed verification may be fruitful for the theory of distributed computing too.