Video: Ohad Ben Baruch, "Lower Bound on the Step Complexity of Anonymous Binary Consensus"

Video From 16w5152: Complexity and Analysis of Distributed Algorithms

Ohad Ben Baruch, Ben Guruion University of the Negev

Friday, December 2, 2016 10:08 - 10:31

Lower Bound on the Step Complexity of Anonymous Binary Consensus

Ohad Ben Baruch, Video: Lower Bound on the Step Complexity of Anonymous Binary Consensus

Ohad Ben Baruch, Lower Bound on the Step Complexity of Anonymous Binary Consensus, Complexity and Analysis of Distributed Algorithms, BIRS, BIRS talk, 16w5152, math, mathematics, video

Banff International Research Station

presentation

mpeg4

88M

http://www.birs.ca/events/2016/5-day-workshops/16w5152/videos

http://www.birs.ca/events/2016/5-day-workshops/16w5152/videos/watch/201612021008-BenBaruch.html

Lower Bound on the Step Complexity of Anonymous Binary Consensus

Ohad Ben Baruch at 16w5152: Complexity and Analysis of Distributed Algorithms on Friday, December 2, 2016

0 seconds of 0 secondsVolume 90%

00:00

Download this video (88M)