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

  • Thèse

    Daniel Tamayo Jiménez. Combinatorics of permutreehedra and geometry of s-permutahedra. Combinatorics [math.CO]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG066⟩. ⟨tel-04302406⟩

    GALaC

    Year of publication

    Available in free access

  • Article dans une revue

    Dominique Barth, Thierry Mautor, Dimitri Watel, Marc-Antoine Weisser. Configuring an heterogeneous smartgrid network: complexity and approximations for tree topologies. Journal of Global Optimization, 2023, ⟨10.1007/s10898-023-01338-0⟩. ⟨hal-04289472⟩

    GALaC

    Year of publication

    Available in free access

  • Communication dans un congrès

    Janne Korhonen, AmiArchitectures et modèles pour l'Interaction Paz, Joel Rybicki, Stefan Schmid, Jukka Suomela. Brief Announcement: Sinkless Orientation Is Hard Also in the Supported LOCAL Model. DISC’21, Oct 2021, Freiburg, Germany. ⟨10.4230/LIPIcs.DISC.2021.58⟩. ⟨hal-04288790⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    AmiArchitectures et modèles pour l'Interaction Paz, Liat Peterfreund. Playing Guess Who with Your Kids. FUN’22 – 11th International Conference on Fun with Algorithms, May 2022, Favignana, Italy. ⟨10.4230/LIPIcs.FUN.2022.23⟩. ⟨hal-04288778⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Monika Henzinger, AmiArchitectures et modèles pour l'Interaction Paz, A. Sricharan. Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs. ESA’22, Sep 2022, Berlin, Germany. ⟨10.4230/LIPIcs.ESA.2022.65⟩. ⟨hal-04288782⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Monika Henzinger, AmiArchitectures et modèles pour l'Interaction Paz, Arash Pourdamghani, Stefan Schmid. The augmentation-speed tradeoff for consistent network updates. SOSR ’22: The ACM SIGCOMM Symposium on SDN Research, Oct 2022, Virtual Event, Unknown Region. pp.67-80, ⟨10.1145/3563647.3563655⟩. ⟨hal-04288766⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Alkida Balliu, Janne Korhonen, Fabian Kuhn, Henrik Lievonen, Dennis Olivetti, et al.. Sinkless Orientation Made Simple. SOSA’23, Jan 2023, Firenze (Florence), Italy. pp.175-191, ⟨10.1137/1.9781611977585.ch17⟩. ⟨hal-04288751⟩

    ParSys

    Year of publication

    Available in free access

  • Communication dans un congrès

    Kyrill Winkler, AmiArchitectures et modèles pour l'Interaction Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid. The Time Complexity of Consensus Under Oblivious Message Adversaries. ITCS23, Jan 2023, Cambridge, United States. ⟨10.4230/LIPIcs.ITCS.2023.100⟩. ⟨hal-04288670⟩

    ParSys

    Year of publication

    Available in free access

  • Pré-publication, Document de travail

    Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler, AmiArchitectures et modèles pour l'Interaction Paz, Stefan Schmid. Topological Characterization of Consensus Solvability in Directed Dynamic Networks. 2023. ⟨hal-04288873⟩

    ParSys

    Year of publication

    Available in free access

  • Article dans une revue

    Armando Castañeda, Pierre Fraigniaud, AmiArchitectures et modèles pour l'Interaction Paz, Sergio Rajsbaum, Matthieu Roy, et al.. Synchronous t-resilient consensus in arbitrary graphs. Information and Computation, 2023, 292, pp.105035. ⟨10.1016/j.ic.2023.105035⟩. ⟨hal-04288737⟩

    ParSys

    Year of publication

    Available in free access