Campus Event Calendar

Event Entry

What and Who

Distributed Computations in Fully-Defective Networks

Ran Gelles
Bar-Ilan University
AG1 Mittagsseminar (own work)
AG 1  
AG Audience

Date, Time and Location

Tuesday, 18 April 2023
30 Minutes
E1 4


In *fully-defective* asynchronous networks all links are subject to an unlimited number of alteration errors, implying that all messages in the network may be completely corrupted. Despite the possible intuition that such a setting is too harsh for any reliable communication, we show how to simulate any algorithm for a noiseless setting over any fully-defective setting, given that the network is 2-edge connected. We further prove that if the network is not 2-edge connected, no non-trivial computation in the fully-defective setting is possible.

Joint work with Keren Censor-Hillel, Shir Cohen, and Gal Sela.


Roohani Sharma
+49 681 9325 1116
--email hidden

Virtual Meeting Details

527 278 8807
passcode not visible
logged in users only

Tags, Category, Keywords and additional notes

If you wish to attend the talk online but do not have the zoom password, please contact Roohani Sharma at

Roohani Sharma, 03/31/2023 20:31
Roohani Sharma, 03/30/2023 11:11 -- Created document.