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

  • Pré-publication, Document de travail

    Pierre Béaur, Benjamin Hellouin de Menibus. Sturmian and infinitely desubstitutable words accepted by an ω-automaton. 2023. ⟨hal-04034705⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Cesar Ceballos, Viviane Pons. The s-weak order and s-permutahedra I: combinatorics and lattice structure. 2023. ⟨hal-04024015⟩

    GALaC

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Benjamin Hellouin de Menibus, Victor H Lutfalla, Camille Noûs. The Domino problem is undecidable on every rhombus subshift. 2023. ⟨hal-04004801⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Vincent Pilaud, Viviane Pons, Daniel Tamayo Jiménez. Permutree sorting. FPSAC 2021 – 33rd International Conference on Formal Power Series and Algebraic Combinatorics, Jan 2022, Ramat Gan, Israel. pp.#31. ⟨hal-03451389⟩

    GALaC

    Year of publication

    Available in free access

  • Thèse

    Charbel Toumieh. Single and multi-agent motion planning for multirotors at high speeds. Robotics [cs.RO]. Université Paris-Saclay, 2022. English. ⟨NNT : 2022UPASG072⟩. ⟨tel-03993261⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Jean-Claude Bermond, Johny Bond, Jean-François Saclé. Large hypergraphs of diameter one. Graph theory and Combinatorics, Academic Press, 1984, Cambridge, United Kingdom. pp.19-28. ⟨hal-02447161⟩

    GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Marc Baboulin, Luc Giraud, Serge Gratton, Julien Langou. Parallel Tools for Solving Incremental Dense Least Squares Problems: Application to Space Geodesy. Journal of Algorithms & Computational Technology, 2009, 3 (1), pp.117-133. ⟨10.1260/174830109787186541⟩. ⟨hal-03973310⟩

    ParSys

    Year of publication

    Available in free access

  • HDR

    Marc Baboulin. Fast and reliable solutions for numerical linear algebra solvers in high-performance computing.. Distributed, Parallel, and Cluster Computing [cs.DC]. Université Paris Sud – Paris XI, 2012. ⟨tel-00967523⟩

    ParSys

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Michael Kruse. Introducing Molly: Distributed Memory Parallelization with LLVM. 2013. ⟨hal-01061501⟩

    ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    Florent Hivert, Anne Schilling, Nicolas M. Thiéry. The biHecke monoid of a finite Coxeter group and its representations. Algebra & Number Theory, 2013, 7 (3), pp.595–671. ⟨10.2140/ant.2013.7.595⟩. ⟨hal-00632266⟩

    GALaC

    Year of publication

    Available in free access