Bounded space on-line bin packing: best is better than first
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Average-case analyses of first fit and random fit bin packing
Random Structures & Algorithms
Majorization and the interconversion of bipartite states
Quantum Information & Computation
The capacity of hybrid quantum memory
IEEE Transactions on Information Theory
| Hi-index | 0.01 |
Several natural partial orders on integral partitions, such as the embeddability, the stable embeddability, the bulk embeddability and the supermajorization, arise in quantum computation, bin-packing and matrix analysis. We find the implications of these partial orders. For integral partitions whose entries are all powers of a fixed number p, we show that the embeddability is completely determined by the supermajorization order and we find an algorithm for determining the stable embeddability.