The following pages link to Ivano Salvo (Q1675916):
Displaying 18 items.
- On minimising the maximum expected verification time (Q1675917) (← links)
- Inefficiencies in network models: a graph-theoretic perspective (Q1685026) (← links)
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs (Q1739106) (← links)
- A characterization of weakly Church-Rosser abstract reduction systems that are not Church-Rosser (Q1854476) (← links)
- Conflict vs causality in event structures (Q1996864) (← links)
- Polynomial recognition of vulnerable multi-commodities (Q2094357) (← links)
- Behavioural logics for configuration structures (Q2123053) (← links)
- Depletable channels: dynamics, behaviour, and efficiency in network design (Q2422775) (← links)
- Characterising spectra of equivalences for event structures, logically (Q2672268) (← links)
- (Q2766539) (← links)
- A Type Inference Algorithm for Secure Ambients (Q2841272) (← links)
- (Q2843918) (← links)
- Undecidability of Quantized State Feedback Control for Discrete Time Linear Hybrid Systems (Q2915110) (← links)
- Depletable Channels: Dynamics and Behaviour (Q3183596) (← links)
- (Q3385652) (← links)
- Intersection types and λ-definability (Q4405687) (← links)
- Linearizing Discrete-Time Hybrid Systems (Q4566875) (← links)
- A CuCh Interpretation of an Object-Oriented Language1 1Partially supported by MURST Cofin '99 TOSCA. (Q4916176) (← links)
