Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Distributed algorithm

Known as: Distributed algorithms 
A distributed algorithm is an algorithm designed to run on computer hardware constructed from interconnected processors. Distributed algorithms are… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2019
Review
2019
Industrial cyber-physical systems (CPSs) are large-scale, geographically dispersed, and life-critical systems, in which lots of… Expand
  • figure 1
  • table I
  • table II
  • table III
  • figure 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
A distributed algorithm for determining the positions of nodes in an ad-hoc, wireless sensor network is explained in detail… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of… Expand
  • figure 1
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1996
Highly Cited
1996
With the existence of many large transaction databases, the huge amounts of data, the high scalability of distributed systems… Expand
  • table 1
  • table 2
  • table 3
  • table 4
  • table 5
Is this relevant?
Highly Cited
1994
Highly Cited
1994
  • N. Lynch
  • Lecture Notes in Computer Science
  • 1994
  • Corpus ID: 33241242
In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms… Expand
Is this relevant?
Highly Cited
1994
Highly Cited
1994
From the Publisher: The second edition of this textbook provides an up-to-date introduction both to the topic, and to the theory… Expand
Is this relevant?
Highly Cited
1993
Highly Cited
1993
A new distributed Euler trail algorithm is proposed to run on an Euler diagraph G(V,E) where each node knows only its adjacent… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton. This simple… Expand
Is this relevant?
Highly Cited
1983
Highly Cited
1983
Abstract : A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1981
Highly Cited
1981
In this paper we consider the problem of organizing a set of mobile, radio-equipped nodes into a connected network. We require… Expand
Is this relevant?