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