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

37B05 Treewidth Algorithm Elliptical distribution Complexity Power Control Linear logic Motives Sequent calculus Completeness Concurrent games Perfect kernel 35B25 Oscillations Sparse matrices Petri nets Mean field games Coinduction Algebra Lie Game semantics Multiple sparse right-hand sides Circle-valued maps Bingham Optimal pattern Commuting variety Machine Learning Denotational semantics Coalgebra Regression Covariance Graphs Concurrency Algebra Age-structured PDE Heterogeneous platforms Axiomatisation Curvature Network science Covert communication Kleene algebra Cost Lambda-calculus Diffusion-approximation Kriging Electron Tomography Unique solution of equations Proof theory Ssreflect Baumslag-Solitar groups Besov spaces Kinetic equation Resilience Automata Clear Channel Assessment Graph theory Fail-stop errors Partial Least Squares Stability Game Semantics Cographs Cycle stealing Implicit computational complexity Sobolev spaces Coq Real-time systems Sparsity Asymptotic analysis Bisimulation Dual norm Symplectic reduction General arrivals Coloring Reliability Event structures 57M60 Secondary 37E05 Bass-Serre theory Decidability Verification Hydrodynamic limit 20E08 Bisimilarity Full abstraction Category theory Regular languages Categorical semantics Termination Spatial Reuse Energy-aware systems Space of subgroups Abbreviated action integral Cyclic proofs Process calculi Activation delays Direct method Scheduling Silent errors Distributive laws Cut elimination Ordonnancement Automatic proof search