Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) ParSys
Redundancy in Distributed Proofs
Ami Paz

04 December 2018, 00h00
Salle/Bat : 465/PCRI-N
Contact :

Activités de recherche : Algorithmique distribuée

Résumé :
Distributed proofs are mechanisms enabling the nodes of a network to collectively and efficiently check the correctness of Boolean predicates on the structure of the network (e.g. having a specific diameter), or on data-structures distributed over the nodes (e.g. a spanning tree). We show that many network predicates have distributed proofs offering a high level of redundancy, explicitly or implicitly. We use this remarkable property of distributed proofs for establishing perfect tradeoffs between the size of the certificate stored at every node, and the number of rounds of the verification protocol.
Joint work with Laurent Feuilloley, Pierre Fraigniaud, Juho Hirvone and Mor Perry.

Pour en savoir plus : https://sites.google.com/view/amipaz/
Séminaires
graph algorithms to help molecular construction
Théorie des graphes
Friday 07 June 2019 - 14h30
Salle : 445 - PCRI-N
Stefi Nouleho .............................................

Sur le nombre des (d,k)-polytopes
Combinatoire
Friday 24 May 2019 - 14h30
Salle : 455 - PCRI-N
Rado Rakotonarivo .............................................

Predicting the structure of RNA-binding protein re
Thursday 23 May 2019 - 00h00
Salle : 465 - PCRI-N
François Major .............................................

Enhancing Asynchronous Iterative Linear Solvers Th
Calcul à haute performance
Tuesday 21 May 2019 - 10h30
Salle : 465 - PCRI-N
Masha Sosonkina .............................................

Simulation of the M13 infection in E.coli
Algorithmique distribuée
Friday 10 May 2019 - 14h00
Salle : 465 - PCRI-N
Da-Jung Cho .............................................