GALaC team at LRI, Paris-Sud
GALaC is a research group at LRI, Paris-Sud University. We are focused on graph theory, combinatorics and network distributed systems algorithmic.
A global presentation of research activities in GALaC was made in 2013 for the AERES evaluation: Slides AERES 2013 and projet.
Recent Posts
Scalable Load Balancing - Distributed Algorithms and the Packing Model
summary: Load imbalance is a recurring problem in High Performance Computing (HPC), which leads to suboptimal performance via the under-use of available resources. As computing systems grow larger, resource management and load balancing become a costly process, especially for dynamic applications that demand periodical workload balance. With this in mind ...
Improved bounds for centered colorings
A vertex coloring \phi of G is p-centered for each connected subgraph H of G either \phi uses more than p colors on H or or there is a color that appears exactly once on H. Centered colorings form one of the families of parameters that allow to capture notions ...
The Domino Problem is undecidable on surface groups
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 ...
Translations: fr