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
Sparsity
Game semantics
Verification
Cycle stealing
Decidability
Stability
Bisimilarity
Perfect kernel
Axiomatisation
Sequent calculus
Bisimulation
Covariance
Oscillations
Coq
Electron Tomography
Clear Channel Assessment
Dual norm
Cyclic proofs
Concurrency
Cographs
Full abstraction
Process calculi
Spatial Reuse
20E08
Lambda-calculus
Real-time systems
Complexity
Termination
Unique solution of equations
Denotational semantics
Covert communication
Automata
Game Semantics
Sparse matrices
Ssreflect
Implicit computational complexity
Scheduling
Bass-Serre theory
Baumslag-Solitar groups
Treewidth
Reliability
Besov spaces
Petri nets
Multiple sparse right-hand sides
Automatic proof search
Coloring
Silent errors
Fail-stop errors
Sobolev spaces
Regression
Mean field games
Direct method
Graphs
Activation delays
37B05
Energy-aware systems
Hydrodynamic limit
Elliptical distributions
Cost
Heterogeneous platforms
Ordonnancement
Algorithm
Commuting variety
Resilience
Diffusion-approximation
Optimal pattern
Kinetic equation
Categorical semantics
35B25
Abbreviated action integral
57M60 Secondary 37E05
Kriging
Asymptotic analysis
Linear logic
Event structures
Algebra
Proof theory
Space of subgroups
Completeness
Age-structured PDE
Power Control
Graph theory
Symplectic reduction
Motives
Bingham
Distributive laws
Kleene algebra
Algebra Lie
Concurrent games
General arrivals
Elliptical distribution
Machine Learning
Network science
Cut elimination
Regular languages
Partial Least Squares
Curvature
Coinduction
Category theory
Circle-valued maps