BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/343
DTSTAMP:20230914T125920Z
SUMMARY:The Strahler Analysis of Binary Trees in Computer Science and in Ot
her Sciences
DESCRIPTION:Speaker: Xavier Viennot (LaBRI\nUniversité Bordeaux 1\n33405 T
alence Cedex\nFrance)\n\nAbstract: \nComputer scientists defined the Strah
ler number of a binary tree in relation with the minimum number of regis
ters needed for the computation of an arithmetical expression. Beautiful a
symptotic analysis for the average Strahler number have been done (Flajole
t\, Vuillemin\, Raoult\, Kemp)\, involving a periodic function coming from
number theory. Surprisingly\, this parameter appear in hydrogeology (Hort
on\, Strahler) for the morphologic study of river networks\, and also in m
olecular biology in the study of RNA secondary structure(Waterman).\n\nApp
lications have been made in computer graphics (synthetic images of trees)\
, the study of some fractal structures in experimental physics\, in radiol
ogy and in the domain of visualization of informations. Underlying this as
ymptotic analysis\, there are deep combinatorial mathematics\, and some ne
w structures have been introduced\, in collaboration with D.Knuth\, called
Kepler towers. These objects belongs to the "heaps of pieces" theory\, wh
ich gives a geometric interpretation of equivalence classes of words in th
e so-called "trace monoid" introduced in computer science by Mazurkiewicz
as a model for concurrency access to data structures.\n
URL:https://www.tcs.tifr.res.in/web/events/343
DTSTART;TZID=Asia/Kolkata:20130227T160000
DTEND;TZID=Asia/Kolkata:20130227T170000
LOCATION:AG-80
END:VEVENT
END:VCALENDAR