BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//labri.fr//NONSGML kigkonsult.se iCalcreator 2.41.92//
CALSCALE:GREGORIAN
METHOD:PUBLISH
UID:5823ace6-39bb-4de4-8f7d-7487f766d838
X-WR-CALNAME:GT AlgoDist\, «Universal Exploration Sequences and Undirected 
 s-t Connectivity»\, 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:20230326T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20240331T020000
RDATE:20250330T020000
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:5823ace6-39bb-4de4-8f7d-7487f766d838
DTSTAMP:20260409T150847Z
CLASS:PUBLIC
DESCRIPTION:Sébastien Bouchard\n\nTitle: Universal Exploration Sequences an
 d Undirected s-t Connectivity\n\nAbstract:\n\n\nUndirected s-t connectivit
 y (USTCON) is a SL-complete problem (SL stands for Symmetric Log-space). D
 uring decades\, researchers tried to propose a log-space algorithm for thi
 s problem. It would prove that SL=L. This was achieved in 2005 by Omer Rei
 ngold. His USTCON algorithm can also be used to construct sequences of int
 egers called universal exploration sequences (UXS) which\, given the numbe
 r of vertices of a graph\, can guide a deterministic walk\, of polynomial 
 length\, allowing to visit all its nodes.\n\nThe talk will present USTCON\
 , UXS\, and provide a high-level view of Reingold's algorithm and its use 
 to construct UXS.\n\n\n\nhttps://algodist.labri.fr/index.php/Main/GT
DTSTART;TZID=Europe/Paris:20240320T110000
DTEND;TZID=Europe/Paris:20240320T120000
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»\, Sébastien Bouchard
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR
