1. A. V. Aho, J. E. Hopcroft, & J. D. Ullman, "The Design and Analysis of Computer Algorithms", Addison-Wesley, Reading, MA, 1974.
2. A. Apostolico, C.S. Iliopoulos & R. Paige, An O(n log n) cost parallel algorithm for the single function coarsest partition problem, in Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987, ed. A. Albrecht, H. Jung and K. Mehlhorn, Akademie-Verlag, Berlin, 1987.
3. R. Cole, Parallel mergesort, Proc. of the 27th IEEE Symp. on Foundations of Computer Science, Toronto (Canada), 1987, pp. 511–516.
4. K. Diks, Parallel recognition of outerplanar graphs, in Proc. of the International Workshop on Parallel Algorithms and Architectures, Suhl (GDR) May 1987, ed. A. Albrecht, H. Jung and K. Mehlhorn, Akademie-Verlag, Berlin, 1987, pp. 105–113.
5. M. R. Garey & D. S. Johnson, "Computers and Intractability: a Guide to the Theory of NP-Completeness", Freeman, San Francisco, CA, 1979.