BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:784a50d1-43ba-405f-a6ec-ceee748220b7
X-WR-CALNAME:GT AlgoDist\, «Some new results with k-set agreement»\, Mouna 
 Safir
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20260329T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
RDATE:20251026T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:784a50d1-43ba-405f-a6ec-ceee748220b7
DTSTAMP:20260517T175018Z
CLASS:PUBLIC
DESCRIPTION:Mouna Safir (IRIF)\n\nTitle: Some new results with k-set agreem
 ent\n\nAbstract:\n\nIn this talk\, I will present our investigation of the
  solvability of k-set agreement among n processes in distributed systems p
 rone to different types of process failures. k-set agreement allows each p
 rocess to propose a value and decide a value such that at most k different
  values are decided by the correct processes\, in such a way that\, if all
  the correct processes propose the same value v\, they will decide v. We s
 pecially explore two scenarios: synchronous message-passing systems prone 
 to up to t Byzantine failures of processes\, and asynchronous shared memor
 y systems prone to up to t crash failures. Our goal is to address the gaps
  left by previous works in these areas. In the message passing system with
  Byzantine failures we enrished the system with authentication\, we presen
 t an algorithm that ensures k-set agreement in only two rounds\, with no c
 onstraints on the number of faults t\, with k determined as k≥⌊n/(n−t)⌋+1\
 , and an optimal algorihtm ensuring k-set agreement in t+1 rounds for k≥⌊n
 /(n−t)⌋. While in the crash asynchronous shared memory systems\, we introd
 uce an algorithm that ensure k-set agreement when n>2t for k≥⌊ (n−t)/(n−2t
 )⌋+1\, and an impossibility result for k≤⌊(n−t)/(n−2t)⌋+1.\n\n\n\nhttps://
 algodist.labri.fr/index.php/Main/GT
DTSTART;TZID=Europe/Paris:20240612T110000
DTEND;TZID=Europe/Paris:20240612T120000
LOCATION:LaBRI salle 178 - lien visio https://webconf.u-bordeaux.fr/b/arn-4
 tr-7gp
SEQUENCE:0
SUMMARY:GT AlgoDist\, «Some new results with k-set agreement»\, Mouna Safir
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
