An orientation of an undirected graph G is a directed graph obtained by replacing each edge {u, v} of G by exactly one of the arcs (u, v) or (v, u). In the min-sum k-paths orienta...
Abstract Some measures of randomness have been introduced for MartinL¨of randomness such as K-reducibility, C-reducibility and vL-reducibility. In this paper we study Schnorr-rand...
The standard subtyping relation used in dyadic session type theories may compromise the liveness of multi-party sessions. In this paper we define a fair subtyping relation for mul...