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