Title	Asynchronous Robot Gathering
Creator	Castañeda, Armando
Publisher	Banff International Research Station for Mathematical Innovation and Discovery
Date Issued	2016-11-28T15:00
Description	This talk is a short tutorial of the study of distributed computing through combinatorial topology. This approach is presented through three variants of the well-known gathering problem, in the context of fully asynchronous crash-prone robots that move on a discrete space modeled as a graph. The results resented are research in progress.
Extent	66 minutes
Subject	Mathematics; Computer science; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: Universidad Nacional Autónoma de México
Series	BIRS Workshop Lecture Videos (Oaxaca de Juárez (Mexico))
Date Available	2017-06-21
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0348373
URI	http://hdl.handle.net/2429/62053
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos