Seminars

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 10:30 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 combi_lix_lri@services.cnrs.fr. Subscribe to ...

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 ...


(Reported to unkwown date) Programming computing media

-- Frédéric Gruau (LRI)

summary: We consider computing media consisting of billions of small identical Processing Elements (PE) communicating locally in space, and with an homogeneous and isotropic distribution. Computing media can scale arbitrary in size. Thus, they represent parallel architectures whose power can grow without limit. However, programming computing media is difficult.

In ...

(Reported to unkwown date) The Bron-Kerbosch algorithm with vertex ordering is output sensitive.

-- George Manoussakis (University of Versailles)

summary: The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer this question by proving that the Bron-Kerbosch Algorithm with vertex ordering, first introduced and studied by Eppstein, Löffler and Strash ...


L’arbre brownien parabolique

-- Nicolas Broutin (Sorbonne Universite)

Je présenterai une construction explicite d'un arbre réel aléatoire à partir d'un mouvement brownien avec drift parabolique. L'objet obtenu est intimement lié au graphes aléatoires et au coalescent multiplicatif, et est distribué comme la limite d'échelle de l'arbre couvrant minimal du graphe complet. On y ...

Some combinatorial aspects of combinatory logic / Quelques aspects combinatoires de la logique combinatoire

-- Samuele Giraudo (LIGM)

https://bbb.lri.fr/playback/presentation/2.0/playback.html?meetingId=39bbfe5742a821b16c1d6669a8ef00da2d072c73-1617178783965

La logique combinatoire est un formalisme introduit par Schönfinkel dans les années 1920 dans le but de supprimer la nécessité des variables dans les expressions. Ce formalisme donne également lieu à un modèle de calcul très proche du ...

Sommes de cotangentes

-- Franz Lehner (TU Graz)

https://bbb.lri.fr/playback/presentation/2.0/playback.html?meetingId=02b8d542f7dedeb822e4e461ae6aab733cec4e88-1615467246972

Les sommes des puissances de la cotangente de la sorte

$$ \sum_{k=0}^{n-1} \cot^m\frac{\alpha+k\pi}{n} $$

apparaissent dans diverses domaines, dont théorie des nombres, topologie et récemment dans l'étude d'un théorème ...

See all

Translations: fr