AAC

Algorithms, Learning and Computation

Algorithms and calculus cover all theoretical and practical, software and hardware aspects of computer science. For a decade, artificial intelligence and learning have been concerned with the automatic design of algorithms and computational processes, guided by data, the expert, the user and/or the environment.

The main research axes of the department concern computational models and their robustness (from high-performance computing to quantum computing, including neural networks and distributed algorithms), processing architectures (graphs, distributed, synchronous or asynchronous processing), and methods (e.g., continuous, combinatorial, stochastic optimization; statistical learning and information theory). By construction, these research axes are the subject of collaborations with other departments, in particular Data Science and Fluid Mechanics-Energetics. The analysis and design of models and processes rely heavily on mathematical approaches (discrete and continuous, including probability, statistics and combinatorics) and statistical physics (in particular on the phase transition phenomena of complex systems), in conjunction with the LMO and CMAP (Maths and Maths. Appli), IJCLab (Physics), L2S (Signal Processing), as well as the LIX and the future LMF (Formal Methods) teams

Application areas include scientific computing (e.g., linear algebra, tensor calculus, numerical optimization, dynamical systems, simulation of quantum algorithms, computational mathematics and physics, systems of differential equations), distributed computing (e.g., cloud, scheduling, virtual currency, ubiquitous computing, autonomous robots, microbiological circuits), and data analysis.

Coordination

Resarch teams of the department

News

Latest publications

  • Communication dans un congrès

    Nicolas Atienza, Christophe Labreuche, Johanne Cohen, Michèle Sebag. Provably Safeguarding a Classifier from OOD and Adversarial Samples: an Extreme Value Theory Approach. ICLR 2025 – The Thirteenth International Conference on Learning Representations, Apr 2025, Singapore (SG), Singapore. ⟨hal-04922382⟩

    AO, GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Jean-Philippe Chancelier, Michel de Lara, Antoine Deza, Lionel Pournin. Geometry of Sparsity-Inducing Norms. 2025. ⟨hal-04886852⟩

    GALaC

    Year of publication

    Available in free access

  • Thèse

    Matthieu Robeyns. Mixed precision algorithms for low-rank matrix and tensor approximations. Computer Science [cs]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG095⟩. ⟨tel-04885863⟩

    ParSys, ParSys

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Johanne Cohen, Laurence Pilard, Jonas Sénizergues. Autostabilizing Minimal Clique Decomposition with Byzantine Faults tolerance. 2025. ⟨hal-04872001⟩

    GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Benjamin Hellouin de Menibus, Mathieu Sablik. Characterisation of sets of limit measures of a cellular automaton iterated on a random configuration. Ergodic Theory and Dynamical Systems, 2016, 38 (2), pp.601-650. ⟨10.1017/etds.2016.46⟩. ⟨hal-01299001⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Nathalie Aubrun, Julien Esnay, Mathieu Sablik. Domino Problem Under Horizontal Constraints. STACS 2020 37th International Symposium on Theoretical Aspects of Computer Science, 2020, Montpellier, France. ⟨10.4230/LIPIcs.STACS.2020.26⟩. ⟨hal-02380657⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Stijn Cambie, François Dross, Kolja Knauer, Xuan Hoang La, Petru Valicov. Partitions of planar (oriented) graphs into a connected acyclic and an independent set. 2024. ⟨hal-04840861⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Brice Chichereau, Stéphane Vialle, Patrick Carribault. Fully integrated quantum method for classical register allocation in LLVM. WIHPQC 2024 – International Workshop on Integrating High-Performance and Quantum Computing and QXE24 – IEEE Quantum Week 2024, Sep 2024, Montréal, Canada. ⟨hal-04839424⟩

    ParSys

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Jȩdrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Centered colorings in minor-closed graph classes. 2024. ⟨hal-04819300⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Jędrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Quickly excluding an apex-forest. 2024. ⟨hal-04819247⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès, Communication dans un congrès

    Jędrzej Hodor, Xuan Hoang La, Piotr Micek, Clément Rambaud. Weak coloring numbers of minor-closed graph classes. ACM-SIAM Symposium on Discrete Algorithms (SODA25), Jan 2025, New Orleans, United States. pp.3325-3334, ⟨10.1137/1.9781611978322.107⟩. ⟨hal-04819269⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Julien Rauch, Brice Chichereau, Stéphane Vialle, Patrick Carribault, Damien Rontani. Investigating parallel execution of quantum Machine Learning circuits on superconducting hardware. QSET 2024 – 4th International Workshop on Quantum Software Engineering and Technology IEEE Quantum Week 2024 (QCE’24), Sep 2024, Montréal, Canada. ⟨hal-04812905⟩

    ParSys

    Year of publication

    Available in free access

  • Proceedings/Recueil des communications

    Hugo Gabrielidis, Filippo Gatti, Stephane Vialle. Pipeline for Semantic Segmentation of Large Railway Point Clouds. Intelligent Data Engineering and Automated Learning – IDEAL 2024, Lecture Notes in Computer Science, 15346, Springer Nature Switzerland, pp.167-179, 2025, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-77731-8_16⟩. ⟨hal-04811058⟩

    ParSys

    Year of publication

  • Article dans une revue

    Nathalie Aubrun, Nicolás Bitar. Self-Avoiding Walks on Cayley Graphs Through the Lens of Symbolic Dynamics. The Electronic Journal of Combinatorics, 2024, 31 (4), pp.P4.24. ⟨10.37236/13065⟩. ⟨hal-04807272⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Pierre Fraigniaud, Minh Hang Nguyen, AmiArchitectures et modèles pour l'Interaction Paz. Brief Announcement: Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structures. DISC 2024, 2024, Madrid, Spain. ⟨10.4230/LIPIcs.DISC.2024.47⟩. ⟨hal-04799395⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Hagit Attiya, Pierre Fraigniaud, AmiArchitectures et modèles pour l'Interaction Paz, Sergio Rajsbaum. Brief Announcement: Solvability of Three-Process General Tasks. DISC 2024, 2024, Madrid, Spain. ⟨10.4230/LIPIcs.DISC.2024.42⟩. ⟨hal-04799398⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Leyla Biabani, AmiArchitectures et modèles pour l'Interaction Paz. k-Center Clustering in Distributed Models. SIROCCO 2024, May 2024, Vietri sul Mare, Italy. pp.83-100, ⟨10.1007/978-3-031-60603-8_5⟩. ⟨hal-04799381⟩

    ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    Pierre Fraigniaud, AmiArchitectures et modèles pour l'Interaction Paz. The topology of local computing in networks. Journal of Applied and Computational Topology, 2024, 8 (4), pp.1069-1098. ⟨10.1007/s41468-024-00185-6⟩. ⟨hal-04799384⟩

    ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    AmiArchitectures et modèles pour l'Interaction Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid, Kyrill Winkler. The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica, 2024, 86 (6), pp.1830-1861. ⟨10.1007/s00453-024-01209-4⟩. ⟨hal-04799403⟩

    ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    AmiArchitectures et modèles pour l'Interaction Paz, Liat Peterfreund. Playing Guess Who with your kids: Code-word strategy against adversaries. Theoretical Computer Science, 2024, 1016, pp.114766. ⟨10.1016/j.tcs.2024.114766⟩. ⟨hal-04799401⟩

    ParSys

    Year of publication

    Available in free access

  • Thèse

    Jules Pénuchot. Advanced techniques for high performance code generation. Distributed, Parallel, and Cluster Computing [cs.DC]. Université Paris-Saclay, 2024. English. ⟨NNT : 2024UPASG050⟩. ⟨tel-04751989⟩

    ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    Nathalie Aubrun, Michael Schraudner. Tilings of the hyperbolic plane of substitutive origin as subshifts of finite type on Baumslag–Solitar groups BS ( 1 , n ). Comptes Rendus. Mathématique, 2024, 362 (G5), pp.553-580. ⟨10.5802/crmath.571⟩. ⟨hal-04727536⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès, Communication dans un congrès

    Nicolas Atienza, Roman Bresson, Cyriaque Rousselot, Philippe Caillou, Johanne Cohen, et al.. Cutting the Black Box: Conceptual Interpretation of a Deep Neural Net with Multi-Modal Embeddings and Multi-Criteria Decision Aid. IJCAI-24, Thirty-Third International Joint Conference on Artificial Intelligence, Aug 2024, Jeju, South Korea. pp.3669-3678, ⟨10.24963/ijcai.2024/406⟩. ⟨hal-04728875⟩

    AO, GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    David Auger, Johanne Cohen, Antoine Lobstein. Nonatomic Non-Cooperative Neighbourhood Balancing Games. Fundamenta Informaticae, 2024, 191 (3-4), pp.239-268. ⟨10.3233/FI-242181⟩. ⟨hal-04728941⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Benjamin Hellouin de Menibus, Victor Lutfalla, Pascal Vanier. Decision problems on geometric tilings. 2024. ⟨hal-04693345⟩

    GALaC

    Year of publication

    Available in free access

  • Rapport

    Thomas Bellitto, Johanne Cohen, Bruno Escoffier, Nguyen Minh Khang, Mikaël Rabie. Canadian Traveller Problems in Temporal Graphs. ArXiv. 2024. ⟨hal-04677440⟩

    GALaC

    Year of publication

    Available in free access

  • Proceedings/Recueil des communications

    Julien Rauch, Damien Rontani, Stéphane Vialle. Generative-Based Algorithm for Data Clustering on Hybrid Classical-Quantum NISQ Architecture. Architecture of Computing Systems, 37th International Conference, ARCS 2024, Potsdam, Germany, May 14–16, 2024, Proceedings, 14842, Springer Nature Switzerland, pp.282-297, 2024, Lecture Notes in Computer Science, 978-3-031-66146-4. ⟨10.1007/978-3-031-66146-4_19⟩. ⟨hal-04676136⟩

    ParSys

    Year of publication

  • Communication dans un congrès

    Manon Blanc, Olivier Bournez. The Complexity of Computing in Continuous Time: Space Complexity Is Precision. International Colloquium on Automata, Languages, and Programming (ICALP), Jul 2024, Tallinn Estonia, Estonia. ⟨10.4230/LIPIcs.ICALP.2024.129⟩. ⟨hal-04664615⟩

    GALaC

    Year of publication

    Available in free access

  • Thèse

    Pierre Béaur. Algorithmique et combinatoire des mots par les représentations S-adiques. Mathématique discrète [cs.DM]. Université Paris-Saclay, 2024. Français. ⟨NNT : 2024UPASG033⟩. ⟨tel-04661982⟩

    GALaC

    Year of publication

    Available in free access