| Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
- D. Aharonov, A. Bredariol Grilo, Y. Liu : “StoqMA vs. MA: the power of error reduction”, [Aharonov 2020]
- Ah. Amamou, M. Camey, Ch. Cérin, J. Rivalan, J. Sopena : “Resources management for controlling dynamic loads in clouds environments. The Wolphin project experience”, [Amamou 2020]
- Y. Amoussou‑Guenou, B. Biais, M. Potop‑Butucaru, S. Tucci‑Piergiovanni : “Rational Behavior in Committee-Based Blockchains”, [Amoussou-Guenou 2020c]
- S. Angelopoulos, M. Voss : “Online Search with Maximum Clearance”, [Angelopoulos 2020e]
- S. Arunachalam, A. Grilo, H. Yuen : “Quantum statistical query learning”, [Arunachalam 2020]
- J.‑C. Bajard, J. Marrez, Th. Plantard, P. Véron : “On Polynomial Modular Number Systems over Z/pZ”, [Bajard 2020]
- L. Blin, A. Durand, S. Tixeuil : “Resource Efficient Stabilization for Local Tasks despite Unknown Capacity Links”, [Blin 2020b]
- S. Bonomi, G. Farina, S. Tixeuil : “Boosting the Efficiency of Byzantine-tolerant Reliable Communication”, [Bonomi 2020a]
- R. Botreau, I. Veissier, P. Perny : “Evaluation of animal welfare at farm level: a combination of different methods”, [Botreau 2020]
- S. Bouchard, Y. Dieudonné, A. Pelc : “Want to Gather? No Need to Chatter!”, [Bouchard 2020a]
- S. Bouchard, Y. Dieudonné, A. Pelc, F. Petit : “Almost Universal Anonymous Rendezvous in the Plane”, [Bouchard 2020c]
- V. Bouquet, F. Delbot, Ch. Picouleau : “Partition of graphs with maximum degree ratio”, [Bouquet 2020a]
- V. Bouquet, F. Delbot, Ch. Picouleau, S. Rovedakis : “On Minimum Dominating Sets in cubic and (claw,H)-free graphs”, [Bouquet 2020b]
- G. Bu, M. Potop‑Butucaru, M. Rabie : “Wireless Broadcast with short labelling”, [Bu 2020b]
- G. Bu, Z. Lotker, M. Potop‑Butucaru, M. Rabie : “Lower and upper bounds for deterministic convergecast with labeling schemes”, [Bu 2020e]
- X. Bui, B.‑M. Bui‑Xuan, L. Chua, M. Hoang Bien : “Intersection graphs of almost subnormal subgroups in general skew linear groups”, [Bui 2020]
- F. Cherigny, H. EL KECHAI, S. Iksal, M. Lefevre, H. Labarthe, V. Luengo : “L'analytique des apprentissages avec le numériqueGroupes thématiques de la Direction du numérique pour l'Éducation (DNE -TN2)”, [Cherigny 2020]
- C. Donnot, A. Genitrini, Y. Herida : “Unranking Combinations Lexicographically: an efficient new strategy compared with others”, [Donnot 2020]
- S. Hatia, M. Shapiro : “Specification of a Transactionally and Causally-Consistent (TCC) database”, [Hatia 2020]
- R. Iakymchuk, D. Mukunoki, A. Podobas, F. Jézéquel, T. Imamura, N. Fujita, J. Huthmann, Sh. Kudo, Y. Tan, J. Domke, K. Ohlhus, T. Fukaya, T. Hoshi, Y. Murakami, M. Nakata, T. Ogita, K. Sano, T. Boku : “White Paper from the Workshop on Large-scale Parallel Numerical Computing Technology (LSPANC 2020): HPC and Computer Arithmetic toward Minimal-Precision Computing”, [Iakymchuk 2020a]
- R. Iakymchuk, M. Barreda, M. Wiesenberger, J. Aliaga, E. Quintana‑Ortí : “Reproducibility Strategies for Parallel Preconditioned Conjugate Gradient”, [Iakymchuk 2020b]
- R. Iakymchuk, M. Barreda, S. Graillat, J. Aliaga, E. Quintana‑Ortí : “Reproducibility of Parallel Preconditioned Conjugate Gradient in Hybrid Programming Environments”, [Iakymchuk 2020c]
- F. Jézéquel, S. Graillat, D. Mukunoki, T. Imamura, R. Iakymchuk : “Can we avoid rounding-error estimation in HPC codes and still get trustful results?”, [Jézéquel 2020a]
- E. Kashefi, D. Leichtle, L. Music, H. Ollivier : “Securing Quantum Computations in the NISQ Era”, [Kashefi 2020]
- D. Mukunoki, K. Ozaki, T. Ogita, R. Iakymchuk : “Conjugate Gradient Solvers with High Accuracy and Bit-wise Reproducibility between CPU and GPU using Ozaki Scheme”, [Mukunoki 2020]
- S. Nair, G. Petri, M. Shapiro : “Proving the safety of highly-available distributed objects (Extended version)”, [Nair 2020b]
- A. Olivo, U. Chabaud, A. Chailloux, F. Grosshans : “Breaking simple quantum position verification protocols with little entanglement”, [Olivo 2020]
- D. Oriedi, Z. Guessoum, C. De Runz, A. Aït Younes : “Models of Social Influence: A Survey”, [Oriedi 2020]
- Sh. Oviatt, L. Soulier : “Conversational Search Conversational Search for Learning Technologies”, [Oviatt 2020]
- F. Quezada, C. Gicquel, S. Kedad‑Sidhoum : “Combining polyhedral approaches and stochastic dual dynamic integer programming for solving the uncapacitated lot-sizing problem under uncertainty”, [Quezada 2020a]
- Th. Scialom, P.‑A. Dray, S. Lamprier, B. Piwowarski, J. Staiano : “ColdGANs: Taming Language GANs with Cautious Sampling Strategies”, [Scialom 2020a]
- Th. Scialom, P.‑A. Dray, S. Lamprier, B. Piwowarski, J. Staiano : “Discriminative Adversarial Search for Abstractive Summarization”, [Scialom 2020c]
- Th. Scialom, P.‑A. Dray, S. Lamprier, B. Piwowarski, J. Staiano : “MLSUM: The Multilingual Summarization Corpus”, [Scialom 2020e]
- M. Soares De Oliveira De Souza, P. Nuno de Souza Moura, J.‑P. Briot : “Modelos de Deep Learning para Estimativa de Tempo em Músicas”, [Soares De Oliveira De Souza 2020]
- N. Sokolovska, P.‑H. Wuillemin : “Latent Instrumental Variables as Priors in Causal Inference based on Independence of Cause and Mechanism”, [Sokolovska 2020]
- S. Tanaka, F. Bonnet, S. Tixeuil, Y. Tamura : “Quixo Is Solved”, [Tanaka 2020]
- D. Wilhelm, L. Arantes, P. Sens : “A scalable causal broadcast that tolerates dynamics of mobile networks”, [Wilhelm 2020]
- H. Yasumi, F. Ooshita, M. Inoue, S. Tixeuil : “Uniform Bipartition in the Population Protocol Model with Arbitrary Communication Graphs”, [Yasumi 2020a]