Distributed Algorithms

By Seif Haridi. 1992

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algorithms & Complexity

Citations in the corpus

Distributed Statistical Machine Learning in Adversarial Settings (2017, background): “Moreover, Byzantine machines can collaborate with each other [20].”
Generalized Byzantine-tolerant SGD (2018, background): “The malicious processes can even collaborate with each other (Lynch, 1996).”
Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulation (2019, background): “Compared to traditional Byzantine tolerance in distributed systems (Lynch, 1996; Avizienis et al., 2004; Tanenbaum & Van Steen, 2007; Fischer et al., 1982), Byzantine tolerance in distributed machine learning has unique properties and challenges.”
An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “…15, no. 4, 2007), Proceedings of the IEEE (vol. 94, no. 4, 2007), ASME Journal of Dynamic Systems, Measurement, and Control (vol. 129, no. 5, 2007), SIAM Journal of Control and Optimization (vol. 48, no.1, 2009), and International Journal of Robust and Nonlinear Control (vol. 21, no. 12, 2011).”
Byzantine-Tolerant Machine Learning (2017, background): “The Byzantine workers have full knowledge of the system, including the choice function F , the vectors proposed by the other workers and can collaborate with each other [11].”
Interactive machine learning for health informatics: when do we need the human-in-the-loop? (2016, background): “For the health domain, of particular interest is the consensus problem , which formed the foundation for distributed computing [90].”
Motion Coordination with Distributed Information (2007, unknown): “The literature on automata theory and parallel computing [41, 42] presents precise notions of distributed algorithms for networks with ﬁxed topology.”
Convergence Analysis of the Incremental Cost Consensus Algorithm Under Different Communication Network Topologies in a Smart Grid (2012, background): “The consensus problem has been studied in several areas, such as social science, animal science [10], and computer science [11].”
Consensus Conditions of Multi-Agent Systems With Time-Varying Topologies and Stochastic Communication Noises (2010, background): “Digital Object Identifier 10.1109/TAC.2010.2042982 [2], multi-senor data fusion [3] and distributed computation [4].”
Distributed Function Calculation via Linear Iterative Strategies in the Presence of Malicious Agents (2011, background): “This assumption of some (or full) knowledge of the network topology via the observability matrix (or the weight matrix ) is similar to the assumptions made by much of the literature on fault-tolerant distributed systems [6], [4], [19], and w e ill adopt it here to demonstrate the resilience of linea”
On quantized consensus by means of gossip algorithm - Part I: Convergence proof (2009, background): “Consensus has a long history in computer science, particularly in distributed computation where a program is divided into parts that run simultaneously on multiple computers communicating over a network [3], [4].”
Distributed verification and hardness of distributed approximation (2010, methodology): “Indeed, distributed algorithms for constructing spanning trees, shortest paths, and other problems have been well studied ([24, 23]).”
Practical Byzantine fault tolerance (1999, methodology): “A detailed formalization of the algorithm using the I/O automaton model [21] is presented in [4].”