Conference paper
Distilling common randomness from bipartite quantum states
Igor Devetak, Andreas Winter
ISIT 2003
Sorting algorithms are developed in the setting of iterative multilevel methods. These algorithms borrow aggregation techniques from algorithms used for the numerical solution of elliptic partial differential equations which are of optimal order in running time and storage space for structured problems. A computationally inexpensive preconditioner drives random data chosen from known distributions towards a special case for which the new sorting algorithms are of optimal order. © 1990 BIT Foundations.
Igor Devetak, Andreas Winter
ISIT 2003
Charles A Micchelli
Journal of Approximation Theory
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
Guo-Jun Qi, Charu Aggarwal, et al.
IEEE TPAMI