Accéder directement au contenu Accéder directement à la navigation

 Laboratoire d’excellence en mathématiques et informatique fondamentale de Lyon – Université de Lyon - Programme Investissements d’Avenir. 

 

 

 

 

Derniers dépôts

Chargement de la page

 

 

 

 

 

Répartition des dépôts par discipline

Répartition des dépôts par type de publication

Évolution des dépôts

 

Mots clés

Recurrence Sparse matrices Kleene theorem Cost Regular languages Lambda-calculus Bisimilarity Ergodic dimension Orbital stability Reduced-state approximation Cycle stealing Termination Axiomatisation Jacobian Periodic traveling waves Algebra Completeness Game Semantics Implicit computational complexity Kinesthetic Kinetic formulation Abbreviated action integral Dual norm Cyclic proofs Unique solution of equations Rewriting Scheduling Proof theory Ssreflect Kinetically constrained models Cut elimination Multiple operating levels Microlocal symmetrizability Automatic proof search Function graph Hyperbolic systems Homotopy classes Partial Least Squares Priority Coloring Mathematics education Multiple servers Game semantics Ordonnancement Graph signal processing Full abstraction General arrivals Decidability Hydrodynamic limit Queue Coq Diffusion-approximation Covert communication Sobolev spaces Multi-server systems Linear complexity Circle-valued maps Linear logic Event structures Elliptical distributions Elliptical distribution Graph theory Focusing Mean field games Expectile regression Stability Hamiltonian dynamics Preemptive-resume Besov spaces Energy estimates Kinetic equation Orthologic Algorithm Activation delays Treewidth Distributive laws Minimal quantum logic Oscillations Harmonic limit Local time Polynomial time complexity Direct method Failures Bisimulation Regression HPC Graphs Ph/Ph/c/N queue Network science General service Resilience Moment map Process calculi Full Abstraction Multiple sparse right-hand sides Petri nets Commuting variety Kriging Kleene algebra Concurrency