Sciweavers

143
Voted
ANCS
2016
ACM
10 years 1 months ago
A Study of Speed Mismatches Between Communicating Virtual Machines
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...
24
Voted
ANALCO
2016
43views more  ANALCO 2016»
10 years 1 months ago
Scaling limit of random k-trees
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 ...
Michael Drmota, Emma Yu Jin
24
Voted
ANALCO
2016
49views more  ANALCO 2016»
10 years 1 months ago
Sampling Weighted Perfect Matchings on the Square-Octagon Lattice
Prateek Bhakta, Dana Randall
36
Voted
ANALCO
2016
65views more  ANALCO 2016»
10 years 1 months ago
The CLT Analogue for Cyclic Urns
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 ...
Noela S. Müller, Ralph Neininger
163
Voted
AML
2016
62views Algorithms» more  AML 2016»
10 years 1 months ago
Martin's maximum revisited
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...
Matteo Viale