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