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