1. S. K. Abdali and B. D. Saunders, Transitive closure and related semiring properties via eliminants, Theoret. Comput. Sci. 40 (1985), 257–274.
2. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading (Mass.) etc. 1974.
3. W. Baur and V. Strassen, The complexity of partial derivatives, Theoret. Comput. Sci. 22 (1983), 317–330.
4. B. A. Carré, Graphs and Networks, The Clarendon Press, Oxford University Press, Oxford 1979.
5. G. N. Frederickson and D. B. Johnson, The complexity of selection and ranking in X + Y and matrices with sorted columns, J. Comput. Syst. Sci. 24 (1982), 197–208.