Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
The Web poses novel and interesting problems for both programming language design and verification--and their intersection. This paper provides a personal outline of one thread of...
Abstract This paper surveys the literature on certificateless encryption schemes. In particular, we examine the large number of security models that have been proposed to prove the...
We study three operational models of name-passing process calculi: coalgebras on (pre)sheaves, indexed labelled transition systems, and history dependent automata. The coalgebraic...
End of CMOS scaling has been discussed in many places since the late 90's. Even if the end of CMOS scaling is irrelevant, it is for sure that we are facing a turning point in...