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