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