123 citations
- École Normale Supérieure de LyonFR62 papers
- Centre National de la Recherche ScientifiqueFR34 papers
- Institut national de recherche en sciences et technologies du numériqueFR34 papers
- Lyon 1 UniversitéFR22 papers
- Laboratoire d’informatique Parallélisme Réseaux Algorithmes DistribuésFR8 papers
- Université Paris CitéFR6 papers
- École PolytechniqueFR5 papers
- Institut de Recherche en Informatique FondamentaleFR5 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR5 papers
- Laboratoire d'Informatique de GrenobleFR5 papers
- LIP6FR5 papers
- Université de Versailles Saint-Quentin-en-YvelinesFR4 papers
4 papers · 1 filter
Maximum independent sets in (pyramid, even hole)-free graphs
Maria Chudnovsky, Stéphan Thomassé, Nicolas Trotignon +1
A \emph{hole} in a graph is an induced cycle with at least 4 vertices. A graph is \emph{even-hole-free} if it does not contain a hole on an even number of vertices. A \emph{pyramid…
Types for Parallel Complexity in the Pi-calculus
Patrick Baillot, Alexis Ghyselen
Type systems as a way to control or analyze programs have been largely studied in the context of functional programming languages. Some of those work allow to extract from a typing…
Intersection Subtyping with Constructors
Olivier Laurent
We study the question of extending the BCD intersection type system with additional type constructors. On the typing side, we focus on adding the usual rules for product types. On…
Studying EM Pulse Effects on Superscalar Microarchitectures at ISA Level
Julien Proy, Karine Heydemann, Fabien Majéric +2
In the area of physical attacks, system-on-chip (SoC) designs have not received the same level of attention as simpler micro-controllers. We try to model the behavior of secure sof…