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