BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen - ECPv5.7.0//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
X-ORIGINAL-URL:https://www.greyc.fr
X-WR-CALDESC:évènements pour GREYC UMR CNRS 6072 - Groupe de Recherche en Informatique, Image, et Instrumentation de Caen
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:20250330T010000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:20251026T010000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Europe/Paris:20250304T104500
DTEND;TZID=Europe/Paris:20250304T114500
DTSTAMP:20260421T142114
CREATED:20250204T142355Z
LAST-MODIFIED:20250204T142355Z
UID:11793-1741085100-1741088700@www.greyc.fr
SUMMARY:Séminaire algorithmique : Vincent Jugé (LIGM\, Univ. G. Eiffel\, Paris Est)\, « Write-efficient updates for AVL trees »
DESCRIPTION:Balanced binary search trees are a common data structure for implementing ordered sets\, with three kinds of queries: checking whether a given value belongs to the set\, inserting a value\, and deleting a value; the two latter queries require updating the data structure. Some implementations\, like red-black trees or weak AVL trees\, allow efficient update procedures\, which run in a top-down way and require an amortized constant number of write operations per update query; by contrast\, AVL trees still require bottom-up updating procedures\, which may require a logarithmic number of write operations per query. \nWe will present recent algorithms for updating AVL trees that bridge this gap: they run in a top-down way and/or require only an amortized constant number of write operations per update query; most of the presentation will be devoted to the latter aspect.
URL:https://www.greyc.fr/event/seminaire-algorithmique-vincent-juge-ligm-univ-g-eiffel-paris-est-write-efficient-updates-for-avl-trees/
LOCATION:Sciences 3- S3 351
CATEGORIES:Amacc,General,News,Séminaire Algo
END:VEVENT
END:VCALENDAR