1.1k citations
- École PolytechniqueFR461 papers
- Centre National de la Recherche ScientifiqueFR295 papers
- Institut national de recherche en sciences et technologies du numériqueFR118 papers
- Centre Inria de SaclayFR62 papers
- Institut Polytechnique de ParisFR60 papers
- CRANFR28 papers
- Université Paris CitéFR28 papers
- Université Paris-SaclayFR26 papers
- Sorbonne UniversitéFR25 papers
- Université de LorraineFR18 papers
- Université Paris-SudFR17 papers
- École Normale Supérieure de LyonFR14 papers
28 papers · 1 filter
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers
Daniel Augot, Françoise Levy-Dit-Vehel, Abdullatif Shikfa
Since the concept of locally decodable codes was introduced by Katz and Trevisan in 2000, it is well-known that information the-oretically secure private information retrieval sche…
Generalization of Gabidulin Codes over Fields of Rational Functions
Daniel Augot
We transpose the theory of rank metric and Gabidulin codes to the case of fields which are not finite fields. The Frobenius automorphism is replaced by any element of the Galois gr…
Random maps: proceeding of the Journ{é}es MAS 2014
Céline Abraham, Jérémie Bettinelli, Gwendal Collet +1
This is a quick survey on some recent works done in the field of random maps.
Homonym Population Protocols, or Providing a Small Space of Computation Using a Few Identifiers
Olivier Bournez, Johanne Cohen, Mikaël Rabie
Population protocols have been introduced by Angluin et al. as a model in which n passively mobile anonymous finite-state agents stably compute a predicate on the multiset of their…
A model-free control strategy for an experimental greenhouse with an application to fault accommodation
Frédéric Lafont, Jean-François Balmat, Nathalie Pessel +1
Writing down mathematical models of agricultural greenhouses and regulating them via advanced controllers are challenging tasks since strong perturbations, like meteorological vari…
Cambrian Hopf Algebras
Grégory Chatel, Vincent Pilaud
Cambrian trees are oriented and labeled trees which fulfill local conditions around each node generalizing the conditions for classical binary search trees. Based on the bijective…