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

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