Asymptotically tight bounds for performing BMMC permutations on parallel disk systems. (English)
SIAM J. Comput. 28, No.1, 105-136 (1998).
1
Using composition to design secure, fault-tolerant systems (English)
HASE, 29- (1998).
2
A Robinson-Schensted algorithm for a class of partial orders. (English)
J. Comb. Theory, Ser. A 79, No.1, 36-52 (1997).
3
A Robinson - Schensted algorithm for a class of partial orders (English)
J. Comb. Theory, Ser. A 79, No. 1, 36-52 (1997).
4
Lattice path enumeration by formal schema. (English)
Adv. Appl. Math. 13, No.2, 216-251 (1992).
5