Posts classified under: Séminaire Algo

Silvère Gangloff (Univ. AGH, Cracovie, Pologne) « Classes de transitivité pour les sous-décalages de type fini multi-dimensionnels » Ce travail est en commun avec B. Hellouin et P. Oprocha. Les sous-décalages de type fini multidimensionnels ont été étudiés dans les dernières décennies à travers le spectre de propriétés topologiques telles que la transitivité ou le … Continue reading Séminaire Algorithmique: ANNULÉ EN RAISON DU MOUVEMENT DE GRÈVE

Self-stabilization is a suitable paradigm for distributed systems, particularly prone to transient faults. Errors such as memory or messages corruption, break of a communication link, can put the system in an inconsistent state. A protocol is self-stabilizing if, whatever the initial state of the system, it guarantees that it will return a normal behavior in … Continue reading Séminaire Algorithmique : Gabriel Le Bouder (LIP6, Sorbonne Univ.) « Memory-Optimization for Self-Stabilizing Distributed Algorithms »

Any Boolean function corresponds to a complete full binary decision tree. This tree can in turn be represented in a maximally compact form as a directed acyclic graph where common subtrees are factored and shared, keeping only one copy of each unique  subtree. This yields the celebrated and widely used structure called reduced ordered binary … Continue reading Séminaire Algorithmique : Julien Clément (GREYC, Caen) « Combinatorics of reduced ordered binary decision diagrams. Application to random uniform sampling »