75 citations
- Université Paris CitéFR78 papers
- Centre National de la Recherche ScientifiqueFR42 papers
- Délégation Paris 7FR14 papers
- Institut national de recherche en sciences et technologies du numériqueFR14 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR11 papers
- Sorbonne UniversitéFR6 papers
- Laboratoire d'Informatique de l'École PolytechniqueFR5 papers
- École Normale Supérieure de LyonFR4 papers
- Computer Algorithms for MedicineAT3 papers
- École Normale Supérieure - PSLFR3 papers
- École PolytechniqueFR3 papers
- Laboratoire de Recherche en InformatiqueFR3 papers
7 papers · 1 filter
On the Space Complexity of Set Agreement
Carole Delporte-Gallet, Hugues Fauconnier, Petr Kuznetsov +1
The -set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to different input values. In a system of …
On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
Jurek Czyzowicz, Leszek Gasieniec, Adrian Kosowski +3
In this work we focus on a natural class of population protocols whose dynamics are modelled by the discrete version of Lotka-Volterra equations. In such protocols, when an agent $…
Indexed linear logic and higher-order model checking
Charles Grellois, Paul-André Melliès
In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as…
Continuous higher randomness
Laurent Bienvenu, Noam Greenberg, Benoit Monin
We investigate the role of continuous reductions and continuous relativisation in the context of higher randomness. We define a higher analogue of Turing reducibility and show that…
On Reducing Linearizability to State Reachability
Ahmed Bouajjani, Michael Emmi, Constantin Enea +1
Efficient implementations of atomic objects such as concurrent stacks and queues are especially susceptible to programming errors, and necessitate automatic verification. Unfortuna…
The -adic Pisot conjecture on two letters
Valérie Berthé, Milton Minervino, Wolfgang Steiner +1
We prove an extension of the well-known Pisot substitution conjecture to the -adic symbolic setting on two letters. The proof relies on the use of Rauzy fractals and on the fact…