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

    Florent Hivert. Machine Checked Proofs and Programs in Algebraic Combinatorics. 14th ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP ’25), Sandrine Blazy, Nicolas Tabareau, Kathrin Stark, Amin Timany, Jan 2025, Denver (Colorado), United States. pp.214 – 230, ⟨10.1145/3703595.3705885⟩. ⟨hal-05682976⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Albane Saintenoy, Emmanuel Léger, Nicolas Thiéry. Teaching GPR Data Processing Methods Using Jupyter Notebooks (from A-Scan to C-Scan). 2025 13th International Workshop on Advanced Ground Penetrating Radar (IWAGPR), Jul 2025, Thessaloniki, Greece. pp.1-4, ⟨10.1109/iwagpr65621.2025.11109022⟩. ⟨hal-05678978⟩

    GALaC

    Year of publication

  • Pré-publication, Document de travail

    Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus, Piotr Oprocha. On the cohomology of homshifts. 2026. ⟨hal-05675094⟩

    GALaC

    Year of publication

    Available in free access

  • Logiciel

    Bruno Aristimunha, Igor Carrara, Pierre Guetschel, Sara Sedlar, Pedro Rodrigues, et al.. Mother of all BCI Benchmarks. 2026, ⟨swh:1:dir:6d89a182d4e69572a73784c6616ef1cee5493d77⟩. ⟨hal-05675918⟩

    AO, BioInfo, ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    Stijn Cambie, François Dross, Kolja Knauer, Hoang La, Petru Valicov. Partitions of Planar (Oriented) Graphs into a Connected Acyclic and an Independent Set. The Electronic Journal of Combinatorics, 2026, 33 (1), pp.27-34. ⟨10.37236/13673⟩. ⟨hal-05677124⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Nishant Chandgotia, Silvère Gangloff, Benjamin Hellouin de Menibus, Piotr Oprocha. Undecidability of the block gluing classes of homshifts. 2026. ⟨hal-05675078⟩

    GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Jhonatan Silva, Johanne Cohen, Daniel Cordeiro. GARN3: A coarse-grained helix centered technique for RNA 3D structures prediction. PLoS ONE, 2026, 21 (6), pp.e0328609. ⟨10.1371/journal.pone.0328609⟩. ⟨hal-05673707⟩

    GALaC

    Year of publication

  • Communication dans un congrès

    Jose Lucas de Melo Costa, Fabrice Popineau, Bich-Liên Doan, Arpad Rimmel, Fabrice Daniel. Leveraging Self-Supervised Learning for Fraud Detection in Tabular Data. 19th Financial Risks International Forum, Institut Louis Bachelier, Mar 2026, Paris, France. ⟨hal-05672093⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    José Lucas de Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan. High Performance, Low Reliability: Uncertainty Benchmarking for Tabular Foundation Models. 34th European Symposium on Artificial Neural Networks, Computational Intelligence and Machine Learning (ESANN 2026), Apr 2026, Bruges, Belgium. ⟨hal-05672090⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Pierre Béaur, France Gheeraert, Benjamin Hellouin de Menibus. String attractors and bi-infinite words. 2026. ⟨hal-05641031⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Hugo Thimonier, José Lucas de Melo Costa, Fabrice Popineau, Arpad Rimmel, Bich-Liên Doan. T-JEPA: Augmentation-Free Self-Supervised Learning for Tabular Data. ICLR 2025 – International Conference on Learning Representations, Apr 2025, Sinagpore, Singapore. ⟨10.48550/arXiv.2410.05016⟩. ⟨hal-05624276⟩

    AO, GALaC, LaHDAK

    Year of publication

    Available in free access

  • Article dans une revue

    Thibault Saintenoy, Marcos Llobera, Nicolas M. Thiéry, Marta Crespo Fernández, Pastor Fábrega-Álvarez, et al.. Topological insights into the diachrony of ancient road networks: Exploratory predictive modelling in the Andean highlands. Journal of Archaeological Science, 2025, 174, pp.106125. ⟨10.1016/j.jas.2024.106125⟩. ⟨hal-05510553⟩

    GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Quentin Chuet, Tianjiao Dai, Qiancheng Ouyang, François Pirot. New Bounds for Proper h‐Conflict‐Free Colorings. Random Structures and Algorithms, 2026, 68 (2), pp.e70054. ⟨10.1002/rsa.70054⟩. ⟨hal-05608183⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Alexis Aune, Oguz Kaya. Latency hiding strategies for matrix multiplication on GPUs using pipelined multiword arithmetic. 2024. ⟨hal-04619183⟩

    ParSys

    Year of publication

    Available in free access

  • Thèse

    Hugo Gabrielidis. High-performance machine learning and data analysis for next-generation railway design. Artificial Intelligence [cs.AIArtificial Intelligence]. Université Paris-Saclay, 2026. English. ⟨NNT : 2026UPAST019⟩. ⟨tel-05555019⟩

    ParSys

    Year of publication

    Available in free access

  • Thèse

    Brice Chichereau. Optimization and evaluation of integrated HPC-Quantum software stacks. Computer Science [cs]. Université Paris-Saclay, 2026. English. ⟨NNT : 2026UPASG008⟩. ⟨tel-05551876⟩

    ParSys, ParSys

    Year of publication

    Available in free access

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

    Julien Rauch, Damien Rontani, Stéphane Vialle. Towards a Quantum Generative Graph-Based Clustering for Molecule Discovery. Quest-IS, Dec 2025, Palaiseau, France. pp.243-251, ⟨10.1007/978-3-032-13855-2_22⟩. ⟨hal-05549507⟩

    ParSys

    Year of publication

  • Article dans une revue

    Amanda Candemil Kanashiro, Hugo Gabrielidis, Filippo Gatti, Manoel Damião Sousa-Neto. Impact of artifact reduction using generative adversarial networks on diagnostic accuracy in cone-beam computed tomography. Journal of Dentistry, 2026, 167, pp.106400. ⟨10.1016/j.jdent.2026.106400⟩. ⟨hal-05549512⟩

    ParSys

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Hugo Boulier, David Coudert, Frédéric Havet, François Pirot. Colouring the interference digraph of a set of requests in a bidirected tree. 2026. ⟨hal-05536580⟩

    GALaC

    Year of publication

    Available in free access

  • Thèse

    Atte Torri. Towards a fast task-based parallel tensor solver for high-dimensional problems. Numerical Analysis [cs.NA]. Université Paris-Saclay, 2025. English. ⟨NNT : 2025UPASG106⟩. ⟨tel-05534633⟩

    ParSys, ParSys

    Year of publication

    Available in free access

  • Thèse

    Philippe Rambaud. Analyse vidéographique de la motricité spontanée du nouveau-né et de l’enfant. Vision par ordinateur et reconnaissance de formes [cs.CV]. Université Paris-Saclay, 2026. Français. ⟨NNT : 2026UPASG007⟩. ⟨tel-05525738⟩

    GALaC, GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Nicanor Carrasco-Vargas, Benjamin Hellouin de Menibus, Rémi Pallen. Parametrized complexity of relations between multidimensional subshifts. 2026. ⟨hal-05499852⟩

    GALaC

    Year of publication

  • Communication dans un congrès

    Florian Galliot, Hoang La, Raphaëlle Maistre, Matthieu Petiteau, Dimitri Watel. Graph reconstruction from queries on triples (Extended abstract). EUROCOMB’25 – 13th European Conference on Combinatorics, Graph Theory and Applications, Aug 2025, Budapest, Hungary. ⟨hal-05416454⟩

    GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Hugo Gabrielidis, Filippo Gatti, Stéphane Vialle. Physics-based super-resolved simulation of 3D elastic wave propagation adopting scalable diffusion transformer. Computer Physics Communications, 2026, 320, pp.109930. ⟨10.1016/j.cpc.2025.109930⟩. ⟨hal-05485963⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Joseph Touzet, Oguz Kaya, Pablo Arrighi, Amélia Durbec. QUIDS: A Large-Scale Distributed Framework for Quantum Irregular Dynamics Simulations. Q-CASA 2025 – IPDPS Workshop on Quantum Computing Algorithms, Systems, and Applications, Jun 2025, Milan, Italy. pp.491-500, ⟨10.1109/IPDPSW66978.2025.00080⟩. ⟨hal-05472605⟩

    ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    Pierre Aboulker, Frédéric Havet, François Pirot, Juliette Schabanel. Minimum Acyclic Number and Maximum Dichromatic Number of Oriented Triangle-Free Graphs of a Given Order. The Electronic Journal of Combinatorics, 2025, 32 (4), pp.P4.27. ⟨10.37236/12862⟩. ⟨hal-05470628⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Reinis Cirpons, Florent Hivert, Assia Mahboubi, Guillaume Melquiond, James D Mitchell, et al.. Certifying the Decidability of the Word Problem in Monoids at Large. CPP 2026 – 15th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2026, Rennes, France. pp.128-142, ⟨10.1145/3779031.3779101⟩. ⟨hal-05448783⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Brice Chichereau, Stéphane Vialle, Miwako Tsuji, Patrick Carribault, Mitsuhisa Sato. HPCQCMark: a new modular HPC-QC benchmarking framework. QCE – 2025 IEEE International Conference on Quantum Computing and Engineering, Aug 2025, Albuquerque, United States. pp.8-14, ⟨10.1109/QCE65121.2025.10285⟩. ⟨hal-05426530⟩

    ParSys

    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. A Simple Lower Bound for Set Agreement in Dynamic Networks. SOSA – 2025 Symposium on Simplicity in Algorithms, Jan 2025, New Orleans, United States. pp.253-262, ⟨10.1137/1.9781611978315.20⟩. ⟨hal-05403931⟩

    ParSys

    Year of publication

    Available in free access

  • Traduction

    Pierre Jehel, Stéphane Vialle. Collaborative Platform for Railway Projects – Business Needs Analysis and Their Formalization as Functional Requirements. 2023. ⟨hal-05371720⟩

    ParSys

    Year of publication

    Available in free access