BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:4731a464-d23b-467f-bf41-b4d6efeca486
X-WR-CALNAME:GT AlgoDist\, «Universal Exploration Sequences and Undirected 
 s-t Connectivity (continued)»\, Sébastien Bouchard
X-WR-TIMEZONE:Europe/Paris
BEGIN:VTIMEZONE
TZID:Europe/Paris
TZUNTIL:20251026T010000Z
BEGIN:STANDARD
TZNAME:CET
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RDATE:20241027T030000
END:STANDARD
BEGIN:DAYLIGHT
TZNAME:CEST
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:4731a464-d23b-467f-bf41-b4d6efeca486
DTSTAMP:20260409T174045Z
CLASS:PUBLIC
DESCRIPTION:Sébastien Bouchard\n\nTitle: Universal Exploration Sequences an
 d Undirected s-t Connectivity (continued)\n\nAbstract:\n\n\nUndirected s-t
  connectivity (USTCON) is a SL-complete problem (SL stands for Symmetric L
 og-space). During decades\, researchers tried to propose a log-space algor
 ithm for this problem. It would prove that SL=L. This was achieved in 2005
  by Omer Reingold. His USTCON algorithm can also be used to construct sequ
 ences of integers called universal exploration sequences (UXS) which\, giv
 en the number of vertices of a graph\, can guide a deterministic walk\, of
  polynomial length\, allowing to visit all its nodes.\n\nThe talk will pro
 vide a high-level view of Reingold's algorithm use to construct UXS\, as a
  continuation of the previous talk.\n\n\n\n\nhttps://algodist.labri.fr/ind
 ex.php/Main/GT
DTSTART;TZID=Europe/Paris:20240327T110000
DTEND;TZID=Europe/Paris:20240327T120000
LOCATION:LaBRI salle 178 - lien visio https://webconf.u-bordeaux.fr/b/arn-4
 tr-7gp
SEQUENCE:0
SUMMARY:GT AlgoDist\, «Universal Exploration Sequences and Undirected s-t C
 onnectivity (continued)»\, Sébastien Bouchard
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
