1. A. Agrawal and H.V. Jagadish, Direct algorithms for computing the transitive closure of database relations,Proc. Int. Conf. on Very Large Data Bases (1987) pp. 255?266.
2. A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
3. V.E. Benes,Mathematical Theory of Connecting Networks and Telephone Traffic (Academic Press, New York, 1965)
4. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions,Proc. 19th Annual ACM Symp. on the Theory of Computing (1987) pp. 1?6.
5. H.-T. Kung and J.-W. Hong, The red-blue pebble game,Proc. 13th Annual ACM Symp. on the Theory of Computing (1980) pp. 326?333.