75 citations
- Université Paris CitéFR30 papers
- Centre National de la Recherche ScientifiqueFR15 papers
- Institut national de recherche en sciences et technologies du numériqueFR7 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR4 papers
- Délégation Paris 7FR3 papers
- École Normale Supérieure de LyonFR3 papers
- Orange (France)FR3 papers
- Computer Algorithms for MedicineAT2 papers
- École Normale Supérieure - PSLFR2 papers
- École PolytechniqueFR2 papers
- Laboratoire de l'Informatique du ParallélismeFR2 papers
- Laboratoire d'Informatique, de Robotique et de Microélectronique de MontpellierFR2 papers
21 papers · 1 filter
Some families of increasing planar maps
Marie Albenque, Jean-François Marckert
Stack-triangulations appear as natural objects when one wants to define some increasing families of triangulations by successive additions of faces. We investigate the asymptotic b…
Cycle time of stochastic max-plus linear systems
Glenn Merlet
We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula…
A Note On Computing Set Overlap Classes
Pierre Charbit, Michel Habib, Vincent Limouzy +3
Let be a finite set of elements and a family of subsets of Two sets and of overlap if $X_i \…
Series which are both max-plus and min-plus rational are unambiguous
Sylvain Lombardy, Jean Mairesse
Consider partial maps from the free monoid into the field of real numbers with a rational domain. We show that two families of such series are actually the same: the unambiguous ra…
Overpartition pairs and two classes of basic hypergeometric series
Jeremy Lovejoy, Olivier Mallet
We study the combinatorics of two classes of basic hypergeometric series. We first show that these series are the generating functions for certain overpartition pairs defined by fr…
Blocking a transition in a Free Choice net and what it tells about its throughput
Bruno Gaujal, Stefan Haar, Jean Mairesse
In a live and bounded Free Choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected o…