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
Kleene theorem
Sobolev spaces
Treewidth
Kinesthetic
Axiomatisation
Cycle stealing
Coinduction
Besov spaces
Ergodic dimension
Cographs
Ph/Ph/c/N queue
Commuting variety
Elliptical distribution
Full Abstraction
Failures
Pi-calculus
Activation delays
Priority
Graph signal processing
Power Control
Linear complexity
Kinetically constrained models
Cyclic proofs
General service
Polynomial time complexity
Proof theory
Verification
Kinetic equation
Implicit computational complexity
General arrivals
Expectile regression
Full abstraction
Coq
Function graph
Decidability
Minimal quantum logic
Process calculi
Concurrency
Diffusion-approximation
Periodic traveling waves
Oscillations
HPC
Jacobian
Hydrodynamic limit
Termination
Mean field games
Cut elimination
Ssreflect
Game Semantics
Kriging
Bingham
Unique solution of equations
Cost
Focusing
Local time
Resilience
Linear logic
Abbreviated action integral
Orthologic
Multiple operating levels
Energy estimates
Mathematics education
Automatic proof search
Orbital stability
Covert communication
Hamiltonian dynamics
Circle-valued maps
Algorithm
Network science
Graphs
Direct method
Bisimilarity
Event structures
Scheduling
Completeness
Petri nets
Ordonnancement
Hyperbolic systems
Multiple sparse right-hand sides
Kleene algebra
Microlocal symmetrizability
Harmonic limit
Moment map
Preemptive-resume
Multiple servers
Graph theory
Stability
Lambda-calculus
Sparse matrices
Elliptical distributions
Algebra
Partial Least Squares
Kinetic formulation
Bisimulation
Coloring
Homotopy classes
Game semantics
Distributive laws
Multi-server systems
Dual norm