1. M.D. Atkinson, The complexity of orders, in Algorithms and Orders (I. Rival ed.), NATO ASI. 255, Kluwer Acad. Publishers (1989), Dordrecht, 195–230.
2. M.D. Atkinson and H.W. Chang, Computing the number of mergings with constraints, Information Processing Letters
24 (1987), 289–292.
3. M.D. Atkinson, On computing the number of linear extensions of a tree, Order
7 (1990), 23–25.
4. G. Birkhoff, Sobre los grupos de automorfismos, Revista Unión Mat. Argentina
11 (1946), 155–157.
5. G. Brightwell and P. Winkler, Counting linear extensions is #P-complete, DIMACS technical report
90-49 (1990).