Selected papers that cite this one
- Rumen Andonov and Sanjay Rajopadhye. Optimal orthogonal tiling of 2-D iterations. Journal of Parallel and Distributed Computing, 45(2):159-165, 15 September 1997.
- Adam W. Bojanczyk. Some complexity results in parallel matrix-based signal processing. Journal of Complexity, 6(3):324-336, September 1990.
- Edith Cohen and Nimrod Megiddo. Strongly polynomial-time and NC algorithms for detecting cycles in periodic graphs. Journal of the ACM, 40(4):791-830, September 1993.
- Patrick Le Gouëslier d'Argence. Affine scheduling on bounded convex polyhedric domains is asymptotically optimal. Theoretical Computer Science, 196(1-2):395-415, 6 April 1998.
- Franz Höfting and Egon Wanke. Minimum cost paths in periodic graphs. SIAM Journal on Computing, 24(5):1051-1067, October 1995.
- Björn Lisper. Total unfolding: theory and applications. Journal of Functional Programming, 4(4):479-498, October 1994.
- M. V. Marathe, H. B. Hunt III, R. E. Stearns, and V. Radhakrishnan. Approximation schemes for PSPACE-complete problems for succint specifications (preliminary version). In Proceedings of the Twenty-Sixth Annual ACM Symposium on the Theory of Computing, pages 468-477, Montréal, Québec, Canada, 23-25 May 1994.
- Madhav V. Marathe, Harry B. Hunt III, Richard E. Stearns, and Venkatesh Radhakrishnan. Approximation algorithms for PSPACE-hard hierarchically and periodically specified problems. SIAM Journal on Computing, 27(5):1237-1261, October 1998.