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