index - Laboratoire d'excellence en Mathématiques et informatique fondamentale de Lyon Accéder directement au contenu

 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

Ergodic dimension Dual norm Covariance Asymptotic analysis Cost Treewidth Scheduling Silent errors Concurrent games Sparsity Harmonic limit Optimal pattern Regression Bingham Commuting variety Direct method Fail-stop errors Full Abstraction Event structures Energy-aware systems Bisimilarity Independent tasks Partial Least Squares Besov spaces Motives Proof theory General service Graphs Sparse matrices HPC Activation delays Stability Distributive laws Kinetic equation Regular languages Coinduction Graph theory Cyclic proofs Process calculi Extreme events Electron Tomography Multiple sparse right-hand sides Coq Automatic proof search Petri nets Ssreflect Bass-Serre theory Heterogeneous platforms Algebra Lambda-calculus Curvature Axiomatisation Homotopy classes Denotational semantics Unique solution of equations Algebra Lie Diffusion-approximation Cycle stealing Game Semantics General arrivals Function graph Hilbert scheme Network science Algorithm Abbreviated action integral Concurrency Hamiltonian dynamics Decidability Expectile regression Hydrodynamic limit Mean field games Game semantics Energy estimates Elliptical distributions Jacobian Hyperbolic systems Bisimulation Coloring Verification Sequent calculus Focusing Implicit computational complexity Failures Cut elimination Elliptical distribution Cographs Full abstraction Energy efficiency Circle-valued maps Termination Oscillations Ordonnancement Kleene algebra Kriging Graph signal processing Covert communication Linear logic Resilience Completeness Sobolev spaces