123 citations
- École Normale Supérieure de LyonFR56 papers
- Institut national de recherche en sciences et technologies du numériqueFR34 papers
- Centre National de la Recherche ScientifiqueFR33 papers
- Lyon 1 UniversitéFR21 papers
- Laboratoire d’informatique Parallélisme Réseaux Algorithmes DistribuésFR8 papers
- École PolytechniqueFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR5 papers
- LIP6FR5 papers
- Université Paris CitéFR5 papers
- Institut de Recherche en Informatique FondamentaleFR4 papers
- Laboratoire d'Informatique de GrenobleFR4 papers
- Université de Versailles Saint-Quentin-en-YvelinesFR4 papers
6 papers · 1 filter
Immersion of transitive tournaments in digraphs with large minimum outdegree
W. Lochet
We prove the existence of a function such that every simple digraph with minimum outdegree greater than contains an immersion of the transitive tournament on vert…
Two-way Two-tape Automata
Olivier Carton, Léo Exibard, Olivier Serre
In this article we consider two-way two-tape (alternating) automata accepting pairs of words and we study some closure properties of this model. Our main result is that such altern…
A self-stabilizing algorithm for maximal matching in link-register model in moves
Johanne Cohen, Georges Manoussakis, Laurence Pilard +1
In the matching problem, each node maintains a pointer to one of its neighbor or to , and a maximal matching is computed when each node points either to a neighbor that itsel…
Network analysis of Japanese global business using quasi-exhaustive micro-data for Japanese overseas subsidiaries
Jean-Pascal Bassino, Pablo Jensen, Matteo Morini
Network analysis techniques remain rarely used for understanding international management strategies. Our paper highlights their value as research tool in this field of social scie…
Forcing clique immersions through chromatic number
Gregory Gauthier, Tien-Nam Le, Paul Wollan
Building on recent work of Dvořák and Yepremyan, we show that every simple graph of minimum degree contains as an immersion and that every graph with chromatic number…
Periodic I/O scheduling for super-computers
Guillaume Aupy, Ana Gainaru, Valentin Le Fèvre
With the ever-growing need of data in HPC applications, the congestion at the I/O level becomes critical in super-computers. Architectural enhancement such as burst-buffers and pre…