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