Resolving Conflicts and Electing Leaders

12/09/2019
by   Steven Finch, et al.
0

We review distributed algorithms for transmitting data (n real numbers) under a broadcast communication model, as well as for maximum finding and for sorting. Our interest is in the basics of recursive formulas and corresponding asymptotics as n→∞. The emphasis is on concrete examples rather than general theory.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/29/2017

Sorting Real Numbers in O(n√( n)) Time and Linear Space

We present an O(n√( n)) time and linear space algorithm for sorting real...
research
02/07/2020

Recursive PGFs for BSTs and DSTs

We review fundamentals underlying binary search trees and digital search...
research
06/12/2019

Broadcasts on Paths and Cycles

A broadcast on a graph G=(V,E) is a function f: V⟶{0,...,diam(G)} such t...
research
07/04/2018

A complete system of deduction for Sigma formulas

The Sigma formulas of the language of arithmetic express semidecidable r...
research
01/23/2020

Communication-Efficient String Sorting

There has been surprisingly little work on algorithms for sorting string...
research
09/10/2018

Parameterized Verification of Coverability in Well-Structured Broadcast Networks

Parameterized verification of coverability in broadcast networks with fi...
research
04/26/2019

Countably Infinite Multilevel Source Polarization for Non-Stationary Erasure Distributions

Polar transforms are central operations in the study of polar codes. Thi...

Please sign up or login with your details

Forgot password? Click here to reset