Optimal lower bounds for some distributed algorithms for a complete network of processors
type: Item
instance of: scholarly article
title: Optimal lower bounds for some distributed algorithms for a complete network of processors
zbMATH Open document ID: 0681.68067
DOI: 10.1016/0304-3975(89)90103-5
author: Ephraim Korach
author: Shlomo Moran
author: Shmuel Zaks
published in: Theoretical Computer Science
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68N25
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4115972
zbMATH Keywords: distributed algorithms
zbMATH Keywords: lower bounds
zbMATH Keywords: complete network of
zbMATH Keywords: processors
zbMATH Keywords: leader election problem
MaRDI profile type: Publication
full work available at URL: 0304-3975(89)90103-5
OpenAlex ID: W2091422818
cites work: Electing a leader in a synchronous ring
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors
cites work: On the message complexity of distributed problems
Recommended article: A lower bound for probabilistic distributed algorithms
Recommended article: Lower Bounds for Distributed Maximum-Finding Algorithms
Recommended article: Q2766858
Recommended article: Q6061689
Recommended article: Universally-optimal distributed algorithms for known topologies
Recommended article: Lower bounds on communication complexity in distributed computer networks
Recommended article: The lower bounds on distributed shortest paths
Recommended article: Two lower bounds in asynchronous distributed computation
Recommended article: On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms
description: scientific article; zbMATH DE number 4115972