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