1. Andronikos, T., Koziris, N., Tsiatsoulis, Z., Papakonstantinou, G., and Tsanakas, P. Lower Time and Processor Bounds for Efficient Mapping of Uniform Dependence Algorithms into Systolic Arrays. To appear in Journal of Parallel Algorithms and Applications. 10, 3–4, 1997.
2. Andronikos, T., Koziris, N., Papakonstantinou, G., and Tsanakas, P. Optimal Scheduling for UET/UET-UCT Generalized n-Dimensional Grid Task Graphs, submitted to Journal of Parallel and Distributed Computing.
3. Bampis, E.,.Delorme, C., and Konig, J.C. Optimal Schedules for d-D Grid Graphs with Communication Delays. Symposium on Theoretical Aspects of Computer Science (STACS96). Grenoble France 1996.
4. Koziris, N., Papakonstantinou, G., and Tsanakas, P. Automatic Loop Mapping and Partitioning into Systolic Architectures. Proceedings of the 5th Panhellenic Conference on Informatics, Dec. 1995, pp. 777–790, Athens
5. Koziris, N., Papakonstantinou, G., and Tsanakas, P. Optimal Time and Efficient Space Free Scheduling For Nested Loops. The Computer Journal. 39, 5, pp. 439–448, 1996.