123 citations
- École Normale Supérieure de LyonFR63 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
6 papers · 1 filter
Super Exponentials in Linear Logic
Esaïe Bauer, Olivier Laurent
Following the idea of Subexponential Linear Logic and Stratified Bounded Linear Logic, we propose a new parameterized version of Linear Logic which subsumes other systems like ELL,…
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Marthe Bonamy, Édouard Bonnet, Nicolas Bousquet +6
A (unit) disk graph is the intersection graph of closed (unit) disks in the plane. Almost three decades ago, an elegant polynomial-time algorithm was found for \textsc{Maximum Cliq…
Automatic Guide Generation for Stan via NumPyro
Guillaume Baudart, Louis Mandel
Stan is a very popular probabilistic language with a state-of-the-art HMC sampler but it only offers a limited choice of algorithms for black-box variational inference. In this pap…
An Optimised Flow for Futures: From Theory to Practice
Nicolas Chappe, Ludovic Henrio, Amaury Maillé +2
A future is an entity representing the result of an ongoing computation. A synchronisation with a "get" operation blocks the caller until the computation is over, to return the cor…
Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments
Fatih Taşyaran, Berkay Demireller, Kamer Kaya +1
Many well-known, real-world problems involve dynamic data which describe the relationship among the entities. Hypergraphs are powerful combinatorial structures that are frequently…
Generalized Tilings with Height Functions
Olivier Bodini, Matthieu Latapy
In this paper, we introduce a generalization of a class of tilings which appear in the literature: the tilings over which a height function can be defined (for example, the famous…