GALaC organizes or participates in three different regular seminars.

GALaC team seminar

The GALaC team seminar is organized once a month on Friday at 14:30 in the Ada Lovelace building at LRI. Recent and up-coming seminars

Plateau Saclay Combinatorics Seminar

The Plateau Saclay Combinatorics Seminar is held every Wednesday morning at 11 AM in room Flajolet (top floor on the left) at LIX. It is co-organized by the Combi team of LIX and the GALaC team. The mailing list for this seminar is Subscribe to this ...

Plateau Saclay Algorithms Seminar

The Plateau Saclay Algorithms Seminar is held every other Friday afternoon in LIX. This working group is partially supported by Labex DigiCosme (Digital worlds: distributed data, programs and architectures). If you do wish (or not) to receive any emails from this seminar, you can subscribe or unsubscribe from the mailing ...

Economics of Age of Information (AoI) Management: Pricing and Competition

-- Lingjie Duan (GALAC, LRI)

Summary: Fueled by the rapid development of communication networks and sensors in portable devices, today many mobile users are invited by content providers to sense and send back real-time useful information (e.g., traffic observations and sensor data) to keep the freshness of the online platforms’ content updates. However, due ...

Généralisation des polynômes de Symanzik en dimensions supérieures

-- Matthieu Piquerez (CMLS, Ecole Polytechnique)

Les deux polynômes de Symanzik sont des invariants de graphe utilisés en théorie quantique des champs pour calculer des intégrales de Feynman. Le premier polynôme de Symanzik est le dual du polynôme de Kirchhoff pondéré, qui compte le nombre pondéré d'arbres couvrants d'un graphe. En 2009, Duval, Klivans ...

Expérimentations sur le calcul hautes performances en combinatoire énumérative et algébrique.

-- Florent Hivert (GALAC, LRI)

Summary : In this talk, I will report on several experiments around large scale enumerations in enumerative and algebraic combinatorics. I'll describe a methodology used to achieve large speedups in several enumeration problems. Indeed, in many combinatorial structures (permutations, partitions, monomials, young tableaux), the data can be encoded as a ...

See all

Translations: fr