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