-
Type
Abstract
We will discuss the leader election problem in systems of networked agents which lack unique identifiers. Namely, we focus on systems using the infinite triangular lattice as an underlying graph structure, introduce an algorithm that "erodes" a simply connected system from the outside inward, and show a proof sketch of correctness.
Description
Discrete Math Seminar
Wednesday, November 17, 2021
1:30pm MST/AZ
WXLR A106 and virtual via Zoom
https://josephbriones.com/zoom
See math.asu.edu/~discrete for scheduled talks.
Speaker
Joseph Briones
PhD Student - Computer Science
Arizona State University
Location
WXLR A106 and virtual via Zoom