This work addresses an apparently simple but elusive problem that arises when doing high speed networking on Virtual Machines. When a VM and its peer (usually the hypervisor) proc...
Luigi Rizzo, Stefano Garzarella, Giuseppe Lettieri...
We consider a random k-tree Gn,k that is uniformly selected from the class of labelled k-trees with n + k vertices. Since 1-trees are just trees, it is well-known that Gn,1 (after ...
A cyclic urn is an urn model for balls of types 0, . . . , m − 1 where in each draw the ball drawn, say of type j, is returned to the urn together with a new ball of type j + 1 ...
We present several results relating the general theory of the stationary tower forcing developed by Woodin with forcing axioms. In particular we show that, in combination with str...
We consider mainly the following version of set theory: “ZF + DC and for every λ, λℵ0 is well ordered”, our thesis is that this is a reasonable set theory, e.g. on the one ...
We present equiconsistency results at the level of subcompact cardinals. Assuming SBHδ, a special case of the Strategic Branches Hypothesis, we prove that if δ is a Woodin cardin...
In connection with his interest in selfdistributive algebra, Richard Laver established two deep results with potential applications in low-dimensional topology, namely the existenc...