Contents Intro.

We consider the problem of sending a message from a source to every other node in a network that is subject to Byzantine failures (that is, some nodes may have arbitrary, possibly malicious, behavior). We first present some recent result on sparse networks, that is, networks whose connectivity falls below classical requirements for this problem. Then, we explore the dynamic network setting, where the topology of the underlying graph evolves through time.

Details

Publication year

2016

Form

電子化映像資料(1時間30分16秒)

Series title

情報科学研究科・ゼミナール講演 ; 平成28年度

Note

講演者所属: Pierre et Marie Curie University

講演日: 平成28年4月6日

講演場所: 情報科学研究科大講義室L1

Country of publication

Japan

Title language

English (eng)

Language of texts

English (eng)

Author information

Tixeuil, Sebastien