Author:
Bampis E.,Delorme C.,König J.-C.
Subject
Artificial Intelligence,Computer Graphics and Computer-Aided Design,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science,Software
Reference22 articles.
1. Communication complexity of PRAMs;Aggarwal;Theoretical Computer Science,1990
2. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, MA, 1974
3. The time complexity of scheduling interval orders with communication is polynomial;Ali;Parallel Processing Letters,1993
4. R.J. Anderson, P. Beame, W. Ruzzo, Low overhead parallel schedules for task graphs, Proceedings of SPAA (1990) 66–75
5. A low overhead schedule for a 3D-grid graph;Bampis;Parallel Processing Letters,1992
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献