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