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

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