Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
Paper
A partition theorem for the infinite subtrees of a tree
Abstract
We prove a generalization for infinite trees of Silver’s partition theorem. This theorem implies a version for trees of the Nash-Williams partition theorem. © 1981 American Mathematical Society.
Related
Conference paper
Placement of multimedia blocks on zoned disks
Renu Tewari, Richard P. King, et al.
IS&T/SPIE Electronic Imaging 1996
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence
Conference paper
Modeling UpLink power control with outage probabilities
Kenneth L. Clarkson, K. Georg Hampel, et al.
VTC Spring 2007