Current teams : | ALMASTY ALSOC APR BD CIAN ComplexNetworks DECISION DELYS LFI MOCAH MoVe NPA PEQUAN PolSys QI RO SMA SYEL |
- S. Abbes, S. GouĂ«zel, V. JugĂ©, J. Mairesse : “Asymptotic combinatorics of ArtinâTits monoids and of some other monoids”, Journal of Algebra, vol. 525, pp. 497-561, (Elsevier) [Abbes 2019]
- P. Afshani, M. Agrawal, B. Doerr, C. Doerr, K. Larsen, K. Mehlhorn : “The query complexity of a permutation-based variant of Mastermind”, Discrete Applied Mathematics, (Elsevier) [Afshani 2019]
- M. AĂŻder, L. Aoudia, M. BaĂŻou, A. Ridha Mahjoub, V. Nguyen : “On the star forest polytope for trees and cycles”, RAIRO - Operations Research, vol. 53 (5), pp. 1763-1773, (EDP Sciences) [AĂŻder 2019]
- K. Altisen, S. Devismes, A. Durand, F. Petit : “Gradual stabilization”, Journal of Parallel and Distributed Computing, vol. 123, pp. 26-45, (Elsevier) [Altisen 2019b]
- M. ANDREONI LOPEZ, D. Mattos, O. Carlos M. B. Duarte, G. Pujolle : “Toward a monitoring and threat detection system based on stream processing as a virtual network function for big data”, Concurrency and Computation: Practice and Experience, (Wiley) [ANDREONI LOPEZ 2019a]
- M. ANDREONI LOPEZ, D. Mattos, Otto Carlos M. B. Duarte, G. Pujolle : “A fast unsupervised preprocessing method for network monitoring”, Annals of Telecommunications - annales des tĂ©lĂ©communications, vol. 74 (3-4), pp. 139-155, (Springer) [ANDREONI LOPEZ 2019b]
- S. Angelopoulos : “Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems”, Theory of Computing Systems, vol. 63 (6), pp. 1413-1447, (Springer Verlag) [Angelopoulos 2019a]
- S. Angelopoulos, Ch. DĂŒrr, Th. Lidbetter : “The expanding search ratio of a graph”, Discrete Applied Mathematics, vol. 260, pp. 51-65, (Elsevier) [Angelopoulos 2019c]
- S. Angelopoulos, G. Lucarelli, K. Nguyen : “PrimalâDual and Dual-Fitting Analysis of Online Scheduling Algorithms for Generalized Flow-Time Problems”, Algorithmica, vol. 81 (9), pp. 3391-3421, (Springer Verlag) [Angelopoulos 2019d]
- S. Angelopoulos, N. Nisse, Dimitrios M. Thilikos : “Preface to special issue on Theory and Applications of Graph Searching”, Theoretical Computer Science, vol. 794, pp. 1-2, (Elsevier) [Angelopoulos 2019e]
- S. Angelopoulos, R. Dorrigiv, A. LĂłpez‑Ortiz : “On the Separation and Equivalence of Paging Strategies and Other Online Algorithms”, Algorithmica, vol. 81 (3), pp. 1152-1179, (Springer Verlag) [Angelopoulos 2019f]
- Th. Arnoux, L. Tabourier, M. Latapy : “Predicting interactions between individuals with structural and dynamical information”, Journal of Interdisciplinary Methodologies and Issues in Science, vol. Analysis of networks and graphs, Graph and network analysis, pp. 3, (Ăditions universitaires dâAvignon) [Arnoux 2019b]
- F. Arzani, G. Ferrini, F. Grosshans, D. Markham : “Random coding for sharing bosonic quantum secrets”, Physical Review A, vol. 100 (2), pp. 022303, (American Physical Society) [Arzani 2019]
- M.‑A. Baazizi, D. Colazzo, G. Ghelli, C. Sartiani : “Parametric schema inference for massive JSON datasets”, The VLDB Journal, vol. 28 (4), pp. 497-521, (Springer) [Baazizi 2019b]
- J.‑C. Bajard, P. Martins, L. Sousa, V. Zucca : “Improving the Efficiency of SVM Classification with FHE”, IEEE Transactions on Information Forensics and Security, vol. 15, pp. 1709-1722, (Institute of Electrical and Electronics Engineers) [Bajard 2019]
- Th. Balabonski, A. Delga, L. Rieg, S. Tixeuil, X. Urbain : “Synchronous Gathering without Multiplicity Detection: a Certified Algorithm”, Theory of Computing Systems, vol. 63 (2), pp. 200-218, (Springer Verlag) [Balabonski 2019a]
- E. Bampas, L. Blin, J. Czyzowicz, D. Ilcinkas, A. Labourel, M. Potop‑Butucaru, S. Tixeuil : “On asynchronous rendezvous in general graphs”, Theoretical Computer Science, vol. 753, pp. 80-90, (Elsevier) [Bampas 2019]
- E. Bartzos, I. Emiris, J. LegerskĂœ, E. Tsigaridas : “On the maximal number of real embeddings of minimally rigid graphs in $\mathbb{R}^2$, $\mathbb{R}^3$ and $S^2$”, Journal of Symbolic Computation, (Elsevier) [Bartzos 2019]
- A. Belbachir, A. El Fallah‑Seghrouchni, A. Casals, M. Pasin : “Smart Mobility Using Multi-Agent System”, Procedia Computer Science, vol. 151, pp. 447-454, (Elsevier) [Belbachir 2019]
- P. Bellot, L. Cappellato, N. Ferro, J. Mothe, F. Murtagh, J.‑Y. Nie, E. Sanjuan, L. Soulier, Ch. Trabelsi : “CONFERENCE REPORT - Report on CLEF 2018: Experimental IR Meets Multilinguality, Multimodality, and Interaction”, Sigir Forum, vol. 52 (2), pp. 72-82, (Association for Computing Machinery (ACM)) [Bellot 2019a]
- M. Belotti, N. Bozic, G. Pujolle, S. Secci : “A Vademecum on Blockchain Technologies: When, Which and How”, Communications Surveys and Tutorials, IEEE Communications Society, vol. 21 (4), pp. 3796-3838, (Institute of Electrical and Electronics Engineers) [Belotti 2019]
- S. BELOUANAS, K.‑L. Thai, P. Spathis, M. Dias De Amorim : “Mobility-assisted offloading in centrally-coordinated cellular networks”, Journal of Network and Computer Applications (JNCA), vol. 128, pp. 1-10, (Elsevier) [BELOUANAS 2019]
- I. Ben El Ouahma, Q. Meunier, K. Heydemann, E. Encrenaz : “Side-channel robustness analysis of masked assembly codes using a symbolic approach”, Journal of Cryptographic Engineering, pp. 1-12, (Springer) [Ben El Ouahma 2019]
- M. Ben Ouanes, H. Samaali, D. Galayko, Ph. Basset, F. Najar : “A new type of triboelectric nanogenerator with self-actuated series-to-parallel electrical interface based on self-synchronized mechanical switches for exponential charge accumulation in a capacitor”, Nano Energy, vol. 62, pp. 465-474, (Elsevier) [Ben Ouanes 2019]
- N. Benabbou, M. Chakraborty, Y. Zick : “Fairness and Diversity in Public Resource Allocation Problems”, Bulletin of the Technical Committee on Data Engineering, (IEEE Computer Society) [Benabbou 2019d]
- P. Bendotti, P. Fouilhoux, C. Rottner : “On the complexity of the Unit Commitment Problem”, Annals of Operations Research, vol. 274 (1-2), pp. 119-130, (Springer Verlag) [Bendotti 2019b]
- P. Bendotti, Ph. ChrĂ©tienne, P. Fouilhoux, A. Pass‑Lanneau : “The Anchor-Robust Project Scheduling Problem”, Operations Research, (INFORMS) [Bendotti 2019e]
- A. Beynier, Y. Chevaleyre, L. GourvĂšs, A. Harutyunyan, J. Lesca, N. Maudet, A. Wilczynski : “Local Envy-Freeness in House Allocation Problems”, Autonomous Agents and Multi-Agent Systems, vol. 33 (5), pp. 591-627, (Springer Verlag) [Beynier 2019c]
- M. Blot, D. Picard, N. Thome, M. Cord : “Distributed Optimization for Deep Learning with Gossip Exchange”, Neurocomputing, vol. 330, pp. 287-296, (Elsevier) [Blot 2019]
- Piero P. Bonissone, B. Bouchon‑Meunier : “Introduction to the Special Issue in Memoriam of Lotfi A. Zadeh [Guest Editorial]”, IEEE Computational Intelligence Magazine, vol. 14 (1), pp. 13-14, (Institute of Electrical and Electronics Engineers) [Bonissone 2019]
- S. Bonomi, A. Del Pozzo, M. Potop‑Butucaru, S. Tixeuil : “Approximate Agreement under Mobile Byzantine Faults”, Theoretical Computer Science, vol. 758, pp. 17-29, (Elsevier) [Bonomi 2019a]
- S. Bonomi, G. Farina, S. Tixeuil : “Multi-hop Byzantine reliable broadcast with honest dealer made practical”, Journal of the Brazilian Computer Society, vol. 25 (1), (Springer Verlag) [Bonomi 2019b]
- S. Bouchard, M. Bournat, Y. DieudonnĂ©, S. Dubois, F. Petit : “Asynchronous approach in the plane: a deterministic polynomial algorithm”, Distributed Computing, vol. 32 (4), pp. 317-337, (Springer Verlag) [Bouchard 2019a]
- B. Bouchon‑Meunier, D. Filev : “Ronald R. Yager, 2018 Lotfi A. Zadeh Pioneer Award Winner: A Pioneering Figure of the Fuzzy Set and Intelligent System Community”, IEEE Systems, Man, and Cybernetics Magazine, vol. 5 (1), pp. 12-20, (Institute of Electrical and Electronics Engineers (IEEE)) [Bouchon-Meunier 2019]
- M. Bournat, A. Datta, S. Dubois : “Self-stabilizing robots in highly dynamic environments”, Theoretical Computer Science, vol. 772, pp. 88-110, (Elsevier) [Bournat 2019]
- M. Bozzio, E. Diamanti, F. Grosshans : “Semi-device-independent quantum money with coherent states”, Physical Review A, vol. 99 (2), pp. 022336, (American Physical Society) [Bozzio 2019]
- Q. Bramas, D. Foreback, M. Nesterenko, S. Tixeuil : “Packet Efficient Implementation of the Omega Failure Detector”, Theory of Computing Systems, vol. 63 (2), pp. 237-260, (Springer Verlag) [Bramas 2019a]
- J.‑P. Briot : “Apprentissage profond et gĂ©nĂ©ration musicale”, BibliothĂšque Tangente n°68, Hors sĂ©rie Intelligence artificielle, pp. 30-37, (Editions PĂŽle Paris) [Briot 2019a]
- Th. Bui, N. Papoulias, S. Stinckwich, M. Ziane, B. Roche : “The Kendrick modelling platform: language abstractions and tools for epidemiology”, BMC Bioinformatics, vol. 20 (1), pp. 312, (BioMed Central) [Bui 2019]
- K. BĂŒlbĂŒl, S. Kedad‑Sidhoum, H. Ćen : “Single-machine common due date total earliness/tardiness scheduling with machine unavailability”, Journal of Scheduling, vol. 22 (5), pp. 543-565, (Springer Verlag) [BĂŒlbĂŒl 2019]
- A. Casals, A. El Fallah‑Seghrouchni, A. Franco BrandĂŁo, C. Pantoja, J. Viterbo : “Resource-dependent contextual planning in AmI”, Procedia Computer Science, vol. 151, pp. 485-492, (Elsevier) [Casals 2019a]
- A. Ceselli, M. Fiore, M. Premoli, S. Secci : “Optimized Assignment Patterns in Mobile Edge Cloud Networks”, Computers and Operations Research, vol. 106, pp. 246-259, (Elsevier) [Ceselli 2019]
- Ch. Chen, A. Ugon, Ch. Sun, W. Chen, C. Philippe, A. Pinna : “Towards a Hybrid Expert System Based on Sleep Eventâs Threshold Dependencies for Automated Personalized Sleep Staging by Combining Symbolic Fusion and Differential Evolution Algorithm”, IEEE Access, vol. 7, pp. 1775-1792, (IEEE) [Chen 2019]
- V. Cohen‑Addad, Ph. Klein, C. Mathieu : “Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics”, SIAM Journal on Computing, vol. 48 (2), pp. 644-667, (Society for Industrial and Applied Mathematics) [Cohen-Addad 2019j]
- V. Cohen‑Addad, V. Kanade, F. Mallmann‑Trenn, C. Mathieu : “Hierarchical Clustering”, Journal of the ACM (JACM), vol. 66 (4), pp. 1-42, (Association for Computing Machinery) [Cohen-Addad 2019k]
- G. Coletti, B. Bouchon‑Meunier : “A study of similarity measures through the paradigm of measurement theory: the classic case”, Soft Computing, vol. 23 (16), pp. 6827-6845, (Springer Verlag) [Coletti 2019a]
- M. Conde Pena, R. DurĂĄn DĂaz, J.‑Ch. FaugĂšre, L. HernĂĄndez Encinas, L. Perret : “Non-quantum cryptanalysis of the noisy version of AaronsonâChristiano's quantum money scheme”, IET Information Security, vol. 13 (4), pp. 362-366, (Institution of Engineering and Technology) [Conde Pena 2019]
- M. Cordier, A. Orieux, B. Debord, F. GĂ©rĂŽme, A. Gorse, M. Chafer, E. Diamanti, Ph. Delaye, F. Benabid, I. Zaquine : “Active engineering of four-wave mixing spectral correlations in multiband hollow-core fibers”, Optics Express, vol. 27 (7), pp. 9803-9814, (Optical Society of America - OSA Publishing) [Cordier 2019]
- J. Courtois, L. Abbas‑Turki, J.‑C. Bajard : “Resilience of randomized RNS arithmetic with respect to side-channel leaks of cryptographic computation”, IEEE Transactions on Computers, vol. 68 (12), pp. 1720-1730, (Institute of Electrical and Electronics Engineers) [Courtois 2019]
- B. Coyle, E. Kashefi, M. Hoban : “Certified Randomness From Steering Using Sequential Measurements”, Cryptography, vol. 3 (4), pp. 27, (MDPI) [Coyle 2019b]
- P. Crescenzi, C. Magnien, A. Marino : “Approximating the Temporal Neighbourhood Function of Large Temporal Graphs”, Algorithms, vol. 12 (10), pp. 211, (MDPI) [Crescenzi 2019]
- E. Delasalles, A. Ziat, L. Denoyer, P. Gallinari : “Spatio-temporal neural networks for space-time data modeling and relation discovery”, Knowledge and Information Systems (KAIS), vol. 61 (3), pp. 1241-1267, (Springer) [Delasalles 2019a]
- S. Devismes, A. Lamani, F. Petit, S. Tixeuil : “Optimal torus exploration by oblivious robots”, Computing, vol. 101 (9), pp. 1241-1264, (Springer Verlag) [Devismes 2019]
- Ch. Dias , C. Gainon de Forsan de Gabriac, V. Guigue, P. Gallinari : “RNN & modĂšle dâattention pour lâapprentissage de profils textuels personnalisĂ©s”, Document numĂ©rique - Revue des sciences et technologies de l'information. SĂ©rie Document numĂ©rique, vol. 22 (3), pp. 9-27, (HermĂšs) [Dias 2019a]
- Y. DieudonnĂ©, Sh. Dolev, F. Petit, M. Segal : “Explicit Communication Among Stigmergic Robots”, International Journal of Foundations of Computer Science, vol. 30 (02), pp. 315-332, (World Scientific Publishing) [DieudonnĂ© 2019]
- C. Doerr, D. Sudholt : “Preface to the Special Issue on Theory of Genetic and Evolutionary Computation”, Algorithmica, vol. 81 (2), pp. 589-592, (Springer Verlag) [Doerr 2019c]
- B. Doerr, C. Doerr, T. Kötzing : “Solving Problems with Unknown Solution Length at Almost No Extra Cost”, Algorithmica, vol. 81, pp. 703-748, (Springer Verlag) [Doerr 2019c]
- T. Douce, D. Markham, E. Kashefi, P. Van Loock, G. Ferrini : “Probabilistic Fault-Tolerant Universal Quantum Computation and Sampling Problems in Continuous Variables”, Physical Review A, vol. 99 (1), pp. 012344, (American Physical Society) [Douce 2019]
- S. Dubois, R. Guerraoui, P. Kuznetsov, F. Petit, P. Sens : “The weakest failure detector for eventual consistency”, Distributed Computing, vol. 32 (6), pp. 479-492, (Springer Verlag) [Dubois 2019]
- Th. Durand, N. Thome, M. Cord : “Exploiting Negative Evidence for Deep Latent Structured Models”, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 41 (2), pp. 337-351, (Institute of Electrical and Electronics Engineers) [Durand 2019]
- A. Dutta, H. Sahbi : “Stochastic Graphlet Embedding”, IEEE Transactions on Neural Networks and Learning Systems, vol. 30 (8), pp. 2369-2382, (IEEE) [Dutta 2019]
- B. Escoffier : “Saving colors and Max Coloring: some fixed-parameter tractability results”, Theoretical Computer Science, vol. 758, pp. 30-41, (Elsevier) [Escoffier 2019a]
- P. Fortin, M. Touche : “Dual tree traversal on integrated GPUs for astrophysical N-body simulations”, International Journal of High Performance Computing Applications, vol. 33 (5), pp. 960-972, (SAGE Publications) [Fortin 2019]
- F. Fossati, D. Medhi, S. Moretti, S. Secci : “Error Estimate and Fairness in Resource Allocation with Inaccurate Information Sharing”, IEEE Networking Letters, vol. 1 (4), pp. 173-177, (IEEE Communications Society) [Fossati 2019a]
- D. Galayko, Ch. Shan, E. Zianbetov, M. Javidan, A. Korniienko, O. Billoint, F. Anceau, E. Colinet, E. Blokhina, J. Juillard : “Synchronized Interconnected ADPLLs for Distributed Clock Generation in 65 nm CMOS Technology”, IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 66 (10), pp. 1673-1677, (Institute of Electrical and Electronics Engineers) [Galayko 2019b]
- J.‑G. Ganascia : “Ăthique et intelligence artificielle”, ENA Hors les murs, magazine des anciens Ă©lĂšves de l'ENA, (Association des Anciens ĂlĂšves de l'Ăcole Nationale d'Administration) [Ganascia 2019b]
- J.‑G. Ganascia : “La rĂ©volution de l'Intelligence artificielle (IA) en autonomie”, Revue DĂ©fense Nationale, (Paris: ComitĂ© d'Ă©tudes de dĂ©fense nationale) [Ganascia 2019d]
- J.‑G. Ganascia : “La science et le mensonge â Les dĂ©rives des technosciences”, Revue Politique et Parlementaire n°1092, (Colin) [Ganascia 2019e]
- J.‑G. Ganascia : “LâIA en mĂ©decine : oracle, instrument ou ersatz ?”, Annales de Dermatologie et de VĂ©nĂ©rĂ©ologie, vol. 146 (12), pp. a12-a13, (Elsevier Masson) [Ganascia 2019f]
- J.‑G. Ganascia : “Peut-on contenir lâintelligence artificielle ?”, Pouvoirs - Revue française dâĂ©tudes constitutionnelles et politiques n°170, L'intelligence artificielle, (Le Seuil) [Ganascia 2019g]
- D. Genius, L. Apvrille, L. Li : “High-level modeling of communication-centric applications: Extensions to a system-level design and virtual prototyping tool”, Microprocessors and Microsystems: Embedded Hardware Design, (Elsevier) [Genius 2019b]
- A. Ghaffarinejad, J. Yavand Hasani, D. Galayko, Ph. Basset : “Superior performance of half-wave to full-wave rectifier as a power conditioning circuit for triboelectric nanogenerators: Application to contact-separation and sliding mode TENG”, Nano Energy, vol. 66, pp. 104137, (Elsevier) [Ghaffarinejad 2019]
- A. Gheorghiu, Th. Kapourniotis, E. Kashefi : “Verification of Quantum Computation: An Overview of Existing Approaches”, Theory of Computing Systems, vol. 63 (4), pp. 715-808, (Springer Verlag) [Gheorghiu 2019]
- Sh. Ghorai, E. Diamanti, A. Leverrier : “Composable security of two-way continuous-variable quantum key distribution without active symmetrization”, Physical Review A, vol. 99 (1), pp. 11, (American Physical Society) [Ghorai 2019a]
- Sh. Ghorai, Ph. Grangier, E. Diamanti, A. Leverrier : “Asymptotic security of continuous-variable quantum key distribution with a discrete modulation”, Physical Review X, vol. 9 (2), pp. 11, (American Physical Society) [Ghorai 2019b]
- H. Gilbert, O. Spanjaard : “Optimizing a Generalized Gini Index in Stable Marriage Problems: NP-Hardness, Approximation and a Polynomial Time Special Case”, Algorithmica, (Springer Verlag) [Gilbert 2019b]
- S. Graillat, F. JĂ©zĂ©quel, R. Picot, F. FĂ©votte, B. LathuiliĂšre : “Auto-tuning for floating-point precision with Discrete Stochastic Arithmetic”, Journal of computational science, vol. 36, pp. 101017, (Elsevier) [Graillat 2019]
- V. Grollemund, P.‑F. Pradat, G. Querin, F. Delbot, G. Le Chat, J.‑F. Pradat‑Peyre, P. Bede : “Machine Learning in Amyotrophic Lateral Sclerosis: Achievements, Pitfalls, and Future Directions”, Frontiers in Neuroscience, vol. 13, pp. 135, (Frontiers) [Grollemund 2019]
- Ch. Gueunet, P. Fortin, J. Jomier, J. Tierny : “Task-based Augmented Contour Trees with Fibonacci Heaps”, IEEE Transactions on Parallel and Distributed Systems, vol. 30 (8), pp. 1889-1905, (Institute of Electrical and Electronics Engineers) [Gueunet 2019a]
- A. Guillon, M.‑J. Lesot, Ch. Marsala : “A proximal framework for fuzzy subspace clustering”, Fuzzy Sets and Systems, vol. 366, pp. 34-45, (Elsevier) [Guillon 2019]
- F. Harrak, F. Bouchet, V. Luengo : “From Student Questions to Student Profiles in a Blended Learning Environment”, Journal of Learning Analytics, vol. 6 (1), pp. 54-84 [Harrak 2019c]
- D. Henrion, S. Naldi, M. Safey El Din : “SPECTRA â a Maple library for solving linear matrix inequalities in exact arithmetic”, Optimization Methods and Software, vol. 34 (1), pp. 62-78, (Taylor & Francis) [Henrion 2019]
- K. Heydemann, J.‑F. Lalande, P. BerthomĂ© : “Formally verified software countermeasures for control-flow integrity of smart card C code”, Computers & Security, vol. 85, pp. 202-224, (Elsevier) [Heydemann 2019]
- S. Houssein, L. Di Marco, C. Schwebel, V. Luengo, P. Morand, P. Gillois : “Consequences of Switching to Blended Learning: The Grenoble Medical School Key Elements.”, Studies in Health Technology and Informatics, vol. 247, pp. 356-360, (IOS Press) [Houssein 2019]
- R. Iakymchuk, S. Graillat, D. Defour, E. Quintana‑OrtĂ : “Hierarchical approach for deriving a reproducible unblocked LU factorization”, International Journal of High Performance Computing Applications, pp. #1094342019832968, (SAGE Publications) [Iakymchuk 2019]
- M. Ibraheem, Kh. HACHICHA, S. Ahmed, L. Lambert, P. Garda : “High-throughput parallel DWT hardware architecture implemented on an FPGA-based platform”, Journal of Real-Time Image Processing, vol. 16 (6), pp. 2043-2057, (Springer Verlag) [Ibraheem 2019]
- M. Jiu, H. Sahbi : “Deep representation design from deep kernel networks”, Pattern Recognition, vol. 88, pp. 447-457, (Elsevier) [Jiu 2019]
- M. Kauers, M. Mezzarobba : “Multivariate Ore Polynomials in SageMath”, ACM Communications in Computer Algebra, vol. 53 (2), pp. 57-60, (Association for Computing Machinery (ACM)) [Kauers 2019]
- A. Krishna, P. Poizat, G. SalaĂŒn : “Checking Business Process Evolution”, Science of Computer Programming, vol. 170, pp. 1-26, (Elsevier) [Krishna 2019]
- N. Kumar, I. Kerenidis, E. Diamanti : “Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol”, Nature Communications, vol. 10, pp. 4152, (Nature Publishing Group) [Kumar 2019]
- R. Lamarche‑Perrin : “An Information-theoretic Framework for the Lossy Compression of Link Streams”, Theoretical Computer Science, (Elsevier) [Lamarche-Perrin 2019]
- S. Lamprier, Th. Gisselbrecht, P. Gallinari : “Contextual Bandits with Hidden Contexts: a Focused Data Capture From Social Media Streams”, Data Mining and Knowledge Discovery, 33, pp. 1853-1893, (Springer) [Lamprier 2019c]
- Ch. LĂ©cuyer : “Confronting the Japanese Challenge: The Revival of Manufacturing at Intel”, Business History Review, vol. 93 (02), pp. 349-373, (Cambridge University Press (CUP)) [LĂ©cuyer 2019]
- G. Lena Cota, S. Ben Mokhtar, G. Gianini, E. Damiani, J. Lawall, G. Muller, L. Brunie : “RACOON++: A Semi-Automatic Framework for the Selfishness-Aware Design of Cooperative Systems”, IEEE Transactions on Dependable and Secure Computing, vol. 16 (4), pp. 635-650, (Institute of Electrical and Electronics Engineers) [Lena Cota 2019]
- H. Li, M. Trocan, D. Galayko : “Virtual fingerprint and two-way ranging-based Bluetooth 3D indoor positioning with RSSI difference and distance ratio”, Journal of Electromagnetic Waves and Applications, vol. 33 (16), pp. 2155-2174, (Taylor & Francis) [Li 2019]
- C. Maestre, Gh. Mukhtar, Ch. Gonzales, S. Doncieux : “Action Generation Adapted to Low-Level and High-Level Robot-Object Interaction States”, Frontiers in Neurorobotics, vol. 13, pp. 56, (Frontiers) [Maestre 2019]
- V. Magron, A. Rocca, Th. Dang : “Certified Roundoff Error Bounds using Bernstein Expansions and Sparse Krivine-Stengle Representations”, IEEE Transactions on Computers, vol. 68 (7), pp. 953-966, (Institute of Electrical and Electronics Engineers) [Magron 2019a]
- V. Magron, M. Forets, D. Henrion : “Semidefinite Approximations of Invariant Measures for Polynomial Systems”, Discrete and Continuous Dynamical Systems - Series B, vol. 24 (12), pp. 6745-6770, (American Institute of Mathematical Sciences) [Magron 2019b]
- V. Magron, M. Safey El Din, M. Schweighofer : “Algorithms for Weighted Sums of Squares Decomposition of Non-negative Univariate Polynomials”, Journal of Symbolic Computation, vol. 93, pp. 200-220, (Elsevier) [Magron 2019c]
- A. Marchal, M.‑A. Miville‑DeschĂȘnes, F. Orieux, N. Gac, Ch. Soussen, M.‑J. Lesot, A. Revault D'Allonnes, Q. SalomĂ© : “ROHSA: Regularized Optimization for Hyper-Spectral Analysis: Application to phase separation of 21 cm data”, Astronomy & Astrophysics - A&A, vol. 626, pp. a101, (EDP Sciences) [marchal 2019]
- V. Mascardi, D. Weyns, A. Ricci, C. Benac Earle, A. Casals, M. Challenger, A. Chopra, A. Ciortea, L. Dennis, Ă. FernĂĄndez DĂaz, A. El Fallah‑Seghrouchni, A. Ferrando, L.‑?. Fredlund, E. Giunchiglia, Z. Guessoum, A. GĂŒnay, K. Hindriks, C. Iglesias, B. Logan, T. Kampik, G. Kardas, V. Koeman, J. Larsen, S. Mayer, T. MĂ©ndez, J. Nieves, V. Seidita, B. Tezel, L. Varga, M. Winikoff : “Engineering Multi-Agent Systems: State of Affairs and the Road Ahead”, Software Engineering Notes, vol. 44 (1), pp. 18-28, (Association for Computing Machinery) [Mascardi 2019]
- L. Masure, C. Dumas, E. Prouff : “A Comprehensive Study of Deep Learning for Side-Channel Analysis”, IACR Transactions on Cryptographic Hardware and Embedded Systems, vol. 2020 (1), pp. 348-375, (IACR) [Masure 2019]
- Th. Mefenza, D. Vergnaud : “Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting”, The Computer Journal, vol. 62 (8), pp. 1194â1213, (Oxford University Press (UK)) [Mefenza 2019a]
- Th. Mefenza, D. Vergnaud : “Polynomial interpolation of the generalized DiffieâHellman and NaorâReingold functions”, Designs, Codes and Cryptography, vol. 87 (1), pp. 75-85, (Springer Verlag) [Mefenza 2019b]
- C. Meignant, D. Markham, F. Grosshans : “Distributing Graph States Over Arbitrary Quantum Networks”, Physical Review A, vol. 100, pp. 052333, (American Physical Society) [Meignant 2019]
- M. Mermillod, Y. Bourrier, E. David, L. Kauffmann, A. Chauvin, N. Guyader, F. Dutheil, C. Peyrin : “The importance of recurrent top-down synaptic connections for the anticipation of dynamic emotions”, Neural Networks, vol. 109, pp. 19-30, (Elsevier) [Mermillod 2019]
- M. Mezzarobba : “Truncation Bounds for Differentially Finite Series”, Annales Henri Lebesgue, vol. 2, pp. 99-148, (UFR de MathĂ©matiques - IRMAR) [Mezzarobba 2019]
- M. Minoux, R. Zorgati : “Sharp upper and lower bounds for maximum likelihood solutions to random Gaussian bilateral inequality systems”, Journal of Global Optimization, vol. 75 (3), pp. 735-766, (Springer Verlag) [Minoux 2019]
- T. Miyoshi, Y. Shimomura, O. Fourmaux : “A P2P-based Communication Framework for Geo-Location Oriented Networks”, Journal of Telecommunications and Information Technology, vol. 2019 (1), pp. 58-66, (Instytut ĆÄ cznoĆci ; PaĆstwowy Instytut Badawczy) [Miyoshi 2019]
- M. Mosli Bouksiaa, F. TRAHAY, A. Lescouet, G. Voron, R. Dulong, A. Guermouche, E. Brunet, G. Thomas : “Using differential execution analysis to identify thread interference”, IEEE Transactions on Parallel and Distributed Systems, vol. 30 (12), pp. 2866-2878, (Institute of Electrical and Electronics Engineers) [Mosli Bouksiaa 2019]
- A. Narayanan : “Polynomial Factorisation using Drinfeld Modules”, Newsletter of the London Mathematical Society, (London Mathematical Society) [Narayanan 2019a]
- A. Narayanan, M. Weidner : “Subquadratic Time Encodable Codes Beating the GilbertâVarshamov Bound”, IEEE Transactions on Information Theory, vol. 65 (10), pp. 6010-6021, (Institute of Electrical and Electronics Engineers) [Narayanan 2019b]
- Th. Nguyen, M. Minoux, S. Fdida : “Optimizing resource utilization in NFV dynamic systems: New exact and heuristic approaches”, Computer Networks, vol. 148, pp. 129-141, (Elsevier) [Nguyen 2019]
- Th. Nguyen, A. Girard, C. Rosenberg, S. Fdida : “Routing via Functions in Virtual Networks: The Curse of Choices”, IEEE/ACM Transactions on Networking, vol. 27 (3), pp. 1192-1205, (IEEE/ACM) [Nguyen 2019]
- A. Nzekon Nzeko'O, M. Tchuente, M. Latapy : “A general graph-based framework for top-N recommendation using content, temporal and trust information”, Journal of Interdisciplinary Methodologies and Issues in Science, vol. Analysis of networks and graphs, Graph and network analysis, (Ăditions universitaires dâAvignon) [Nzekon Nzeko'O 2019a]
- M. Olejniczak, A. Severo Pereira Gomes, J. Tierny : “A Topological Data Analysis Perspective on Non-Covalent Interactions in Relativistic Calculations”, International Journal of Quantum Chemistry, vol. e26133, (Wiley) [Olejniczak 2019]
- L. Ostermann, C. Meignant, C. Genes, H. Ritsch : “Super- and subradiance of clock atoms in multimode optical waveguides”, New Journal of Physics, vol. 21 (2), pp. 025004, (Institute of Physics: Open Access Journals) [Ostermann 2019]
- A. Ouadjaout, A. MinĂ© : “Quantitative Static Analysis of Communication Protocols using Abstract Markov Chains”, Formal Methods in System Design, vol. 54 (1), pp. 64-109, (Springer Verlag) [Ouadjaout 2019]
- C. Pantoja, H. Soares, J. Viterbo, T. Alexandre, A. Casals, A. El Fallah‑Seghrouchni : “Exposing IoT Objects in the Internet Using the Resource Management Architecture”, International Journal of Software Engineering and Knowledge Engineering, vol. 29 (11n12), pp. 1703-1725, (World Scientific Publishing) [Pantoja 2019b]
- F. Pascual, K. Rzadca : “Optimizing egalitarian performance when colocating tasks with types for cloud data center resource management”, IEEE Transactions on Parallel and Distributed Systems, (Institute of Electrical and Electronics Engineers) [Pascual 2019]
- A. Payen, L. Tabourier, M. Latapy : “Spreading dynamics in a cattle trade network: Size, speed, typical profile and consequences on epidemic control strategies”, PLoS ONE, vol. 14 (6), pp. e0217972, (Public Library of Science) [Payen 2019]
- S. Pramanik, M. Sharma, M. Danisch, Q. Wang, J.‑L. GUILLAUME, B. Mitra : “Easy-Mention: a model-driven mention recommendation heuristic to boost your tweet popularity”, International Journal of Data Science and Analytics, vol. 7 (2), pp. 131-147, (Springer Verlag) [Pramanik 2019]
- D. Raffo, R. Bendraou, L. Huang, F. Maggi : “Innovative process paradigms and data driven analytics: A new horizon for software and systems process”, Journal of Software: Evolution and Process, vol. 31 (6), Innovative process paradigms and data driven analytics: A new horizon for software and systems process, (John Wiley & Sons, Ltd.) [Raffo 2019]
- Y. Rucar, J.‑G. Ganascia : “An ontology and a memory island to give access to digital literature works”, Digital Scholarship in the Humanities, vol. 34 (Supplement_1), pp. i150-i155, (Oxford University Press) [Rucar 2019]
- L. Tabourier, D. Bernardes, A.‑S. Libert, R. Lambiotte : “RankMerging: A supervised learning-to-rank framework to predict links in large social networks”, Machine Learning, vol. 108 (10), pp. 1729-1756, (Springer Verlag) [Tabourier 2019]
- L. Tamine, L. Soulier, G.‑H. Nguyen, N. Bricon‑Souf : “Offline versus Online Representation Learning of Documents Using External Knowledge”, ACM Transactions on Information Systems, vol. 37 (4), pp. 42:1-42:34, (Association for Computing Machinery) [Tamine 2019]
- S. Tigane, L. Kahloul, S. Benharzallah, S. Baarir, S. Bourekkache : “Reconfigurable GSPNs: A modeling formalism of evolvable discrete-event systems”, Science of Computer Programming, vol. 183, pp. 102302, (Elsevier) [tigane 2019]
- A. Unnikrishnan, D. Markham : “Authenticated teleportation with one-sided trust”, Physical Review A, vol. 100 (3), pp. 032314, (American Physical Society) [Unnikrishnan 2019a]
- A. Unnikrishnan, I. MacFarlane, R. Yi, E. Diamanti, D. Markham, I. Kerenidis : “Anonymity for Practical Quantum Networks”, Physical Review Letters, vol. 122 (24), (American Physical Society) [Unnikrishnan 2019b]
- I. Vankov, D. Mills, P. Wallden, E. Kashefi : “Methods for Classically Simulating Noisy Networked Quantum Architectures”, Quantum Science and Technology, vol. 5 (1), pp. 014001, (IOP Science) [Vankov 2019]
- J. Vidal, J. Budin, J. Tierny : “Progressive Wasserstein Barycenters of Persistence Diagrams”, IEEE Transactions on Visualization and Computer Graphics, (Institute of Electrical and Electronics Engineers) [Vidal 2019]
- A. Volkova, M. Istoan, F. De Dinechin, Th. Hilaire : “Towards Hardware IIR Filters Computing Just Right: Direct Form I Case Study”, IEEE Transactions on Computers, vol. 68 (4), pp. 597-608, (Institute of Electrical and Electronics Engineers) [Volkova 2019]
- P. Wallden, E. Kashefi : “Cyber security in the quantum era”, Communications of the ACM, vol. 62 (4), pp. 120-120, (Association for Computing Machinery) [Wallden 2019]
- A. Wilmet, T. Viard, M. Latapy, R. Lamarche‑Perrin : “Degree-based Outlier Detection within IP Traffic Modelled as a Link Stream”, Computer Networks, vol. 161, pp. 197-209, (Elsevier) [Wilmet 2019b]
- K. Zhang, Ch. Fei, B. Xie, Y. Wang, Zh. Gong, Ch. Xie, Th. Nguyen, Y. Yao, K. MIAO : “Multi-Constraint Optimized Planning of Tasks on Virtualized-Service Pool for Mission-Oriented Swarm Intelligent Systems”, Applied Sciences, vol. 9 (15), pp. 3010, (Multidisciplinary digital publishing institute (MDPI)) [Zhang 2019]
- Y. Zhao, H. Feng, P. Gallinari : “Embedding Learning with Triple Trustiness on Noisy Knowledge Graph”, Entropy, vol. 21 (11), pp. 1083, (MDPI) [Zhao 2019]