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

Subscribe to mailing list with the following title "SUBSCRIBE" LastName FirstNale

Unsubscribe to mailing list with the following title with the following title "UNSUBSCRIBE"

Recent and up-coming seminars

Recherche Opérationnelle à Google

-- Laurent Perron (Google)

summary: A travers une série d'exemples, je décrierai les applications de la recherche opérationnelle et de l'optimisation discrète à Google. Puis je me focaliserai sur l'apport récent des techniques des moteurs SAT (satisfiabilité) et les challenges et opportunités qui lui sont liées.

Matchings and related structures with Specified Color Properties In Vertex- or Edge-colored Graphs.

-- Yannis Manoussakis (University Paris South and CNRS)

summary: We consider problems in edge- or vertex colored graphs. As an example, the Web graph may be considered as a vertex-colored graph where the color of a vertex represents the content of the corresponding page (red for mathematics, yellow for physics, etc.). When the edges/vertices of graphs are ...

The Domino Problem is undecidable on surface groups

-- Nathalie Aubrun (ENS lyon)

summary: The domino problem for a finitely generated group asks whether there exists an algorithm which takes as input a finite alphabet and finitely many Wang tiles, and decides whether there exists a tiling of the group by this set of tiles. I will survey known results and present the ...

See all

Translations: fr