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
Completeness
Mean field games
Decidability
Ergodic dimension
Optimal pattern
Commuting variety
Resilience
Covert communication
Independent tasks
Harmonic limit
Algebra
Scheduling
Silent errors
HPC
Extreme events
Hamiltonian dynamics
Verification
Graph signal processing
Hyperbolic systems
Bass-Serre theory
Full abstraction
Full Abstraction
Bisimulation
Function graph
Lambda-calculus
Expectile regression
Event structures
Game Semantics
Multiple sparse right-hand sides
Concurrency
Coinduction
General arrivals
Termination
Energy efficiency
Homotopy classes
Hydrodynamic limit
Regression
Diffusion-approximation
Electron Tomography
General service
Coloring
Energy estimates
Concurrent games
Failures
Game semantics
Motives
Unique solution of equations
Sparse matrices
Ordonnancement
Automatic proof search
Distributive laws
Process calculi
Jacobian
Focusing
Proof theory
Curvature
Cyclic proofs
Covariance
Petri nets
Cut elimination
Sparsity
Network science
Partial Least Squares
Kriging
Graph theory
Sequent calculus
Coq
Besov spaces
Heterogeneous platforms
Direct method
Algorithm
Bisimilarity
Regular languages
Abbreviated action integral
Cycle stealing
Cographs
Stability
Implicit computational complexity
Denotational semantics
Oscillations
Bingham
Axiomatisation
Hilbert scheme
Circle-valued maps
Dual norm
Elliptical distributions
Kleene algebra
Asymptotic analysis
Algebra Lie
Elliptical distribution
Kinetic equation
Activation delays
Linear logic
Fail-stop errors
Sobolev spaces
Energy-aware systems
Cost
Treewidth
Graphs
Ssreflect