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