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