Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
A table-lookup technique for sorting is developed. It is a highly parallel method which develops an approximation to the sort through a single access to an associative memory. A postprocessing step is intended to complete the sort. The scheme is most effective for special data classes. © 1989.
Igor Devetak, Andreas Winter
ISIT 2003
A.R. Conn, Nick Gould, et al.
Mathematics of Computation
W.C. Tang, H. Rosen, et al.
SPIE Optics, Electro-Optics, and Laser Applications in Science and Engineering 1991
Tong Zhang, G.H. Golub, et al.
Linear Algebra and Its Applications