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

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