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

    Hugo Gabrielidis, Filippo Gatti, Stéphane Vialle. Génération conditionelle et inconditionelle de signaux sismiques à l’aide de modèles de diffusion. 16ème Colloque National en Calcul de Structures, CNRS, CSMA, ENS Paris-Saclay, CentraleSupélec, May 2024, Giens, France. ⟨hal-04610943⟩

    ParSys

    Year of publication

  • Pré-publication, Document de travail

    Quentin Japhet, Dimitri Watel, Dominique Barth, Marc-Antoine Weisser. Maximal Line Digraphs. 2024. ⟨hal-04587485v2⟩

    GALaC

    Year of publication

    Available in free access

  • Thèse

    Jie Hu. Rainbow subgraphs and properly colored subgraphs in colored graphs. Combinatorics [math.CO]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG045⟩. ⟨tel-04588976⟩

    GALaC

    Year of publication

    Available in free access

  • Thèse

    Jonathan Raiman. DeepType : Natural Language Understanding by Abstraction. Artificial Intelligence [cs.AI]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG016⟩. ⟨tel-04588554⟩

    AO, GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Olivier Hudry, Ville Junnila, Antoine Lobstein. On Iiro Honkala’s contributions to identifying codes. Fundamenta Informaticae, In press. ⟨hal-04568130⟩

    GALaC

    Year of publication

  • Pré-publication, Document de travail

    Ylène Aboulfath, Dimitri Watel, Marc-Antoine Weisser, Thierry Mautor, Dominique Barth. Maximizing minimum cycle bases intersection. 2024. ⟨hal-04559959⟩

    GALaC

    Year of publication

    Available in free access

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

    Jérémy Fix, Stéphane Vialle, Remi Hellequin, Claudine Mercier, Patrick Mercier, et al.. Feedback from a data center for education at CentraleSupélec engineering school. 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), May 2022, LYON (Université Lyon 3), France. pp.330-337, ⟨10.1109/IPDPSW55747.2022.00065⟩. ⟨hal-04556247⟩

    ParSys

    Year of publication

  • Communication dans un congrès

    Vida Dujmović, Robert Hickingbotham, Jędrzej Hodor, Gwenaël Joret, Hoang La, et al.. The Grid-Minor Theorem Revisited. SODA 2024 – 2024 Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2024, Westin Alexandria Old Town, United States. pp.1241-1245, ⟨10.1137/1.9781611977912.48⟩. ⟨hal-04553168⟩

    GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Marcin Briański, Jędrzej Hodor, Hoang La, Piotr Micek, Katzper Michno. Boolean Dimension of a Boolean Lattice. Order, 2024. ⟨hal-04553148⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Lech Duraj, Ross J. Kang, Hoang La, Jonathan Narboni, Filip Pokrývka, et al.. The $chi$-binding function of $d$-directional segment graphs. 2024. ⟨hal-04553176⟩

    GALaC

    Year of publication

    Available in free access