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