1. Complexity results and algorithms for the { < ⩽ = }-constrained scheduling;Berger,1991
2. Take a walk, grow a tree;Bhatt,1988
3. Optimal simulations of tree machines;Bhatt,1986
4. Tight bounds for on-line tree embeddings;Bhatt,1990
5. Competitive implementation of parallel programs;Deng,1993