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

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