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
35 papers · 1 filter
Faster integer multiplication using plain vanilla FFT primes
David Harvey, Joris van der Hoeven
Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that n-bit integers may be multiplied in O(n log n 4^(log^* n)) bit operations.
Bijections for Weyl Chamber walks ending on an axis, using arc diagrams and Schnyder woods
Julien Courtiel, Éric Fusy, Mathias Lepoutre +1
In the study of lattice walks there are several examples of enumerative equivalences which amount to a trade-off between domain and endpoint constraints. We present a family of suc…
A bijective study of Basketball walks
Jérémie Bettinelli, Éric Fusy, Cécile Mailler +1
The Catalan numbers count many classes of combinatorial objects. The most emblematic such objects are probably the Dyck walks and the binary trees, and, whenever another class of c…
On the Compositionality of Quantitative Information Flow
Yusuke Kawamoto, Konstantinos Chatzikokolakis, Catuscia Palamidessi
Information flow is the branch of security that studies the leakage of information due to correlation between secrets and observables. Since in general such correlation cannot be a…
Optimal Energy Harvesting from Vortex-Induced Vibrations of Cables
G. O. Antoine, E. de Langre, S. Michelin
Vortex-induced vibrations (VIV) of flexible cables are an example of flow-induced vibrations that can act as energy harvesting systems by converting energy associated with the spon…
K-clique-graphs for Dense Subgraph Discovery
G. Nikolentzos, P. Meladianos, Y. Stavrakas +1
Finding dense subgraphs in a graph is a fundamental graph mining task, with applications in several fields. Algorithms for identifying dense subgraphs are used in biology, in finan…