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