An approach to parallel algorithm design
Georgakopoulos, G. ; Stafylopatis, A.
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993), p. 85-95 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1993-01-01
@article{ITA_1993__27_2_85_0,
     author = {Georgakopoulos, G. and Stafylopatis, A.},
     title = {An approach to parallel algorithm design},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {27},
     year = {1993},
     pages = {85-95},
     mrnumber = {1217679},
     zbl = {0770.68034},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1993__27_2_85_0}
}

Georgakopoulos, G.; Stafylopatis, A. An approach to parallel algorithm design. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 27 (1993) pp. 85-95. http://gdmltest.u-ga.fr/item/ITA_1993__27_2_85_0/

1. F. Afrati, Ch. Papadimitriou and G. Papageorgiou, Scheduling Dags to Minimize Time and Communication, Aegian Workshop on Computing (AWOC), Corfu, June 1988. | MR 1017467

2. A. V. Aho, J. E. Hopcroft and J. D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974. | MR 413592 | Zbl 0326.68005

3. S. G. Akl, The Design and Analysis of Parallel Algorithms, Prentice-Hall, 1989. | Zbl 0754.68053

4. N. Biggs, Algebraic Graph Theory, Cambridge University Press, 1974. | MR 347649 | Zbl 0284.05101

5. R. B. Boppana, J. Hastad and S. Zachos, Does Co-NP Have Short Interactive Proofs?, Information Processing Letters, Vol. 25, 1987, pp. 27-32. | MR 896155 | Zbl 0653.68037

6. E. G. Coffman and P. J. Denning, Operating Systems Theory, Prentice-Hall, 1973.

7. E. G. COFFMAN (Editor), Computer and Job-shop Scheduling Theory, John Wiley, 1976. | MR 629691 | Zbl 0359.90031

8. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, 1979. | MR 519066 | Zbl 0411.68039

9. D. K. Goyal, Scheduling Processor Bound Systems, Report No CS-76-036, Washington State University, 1976.

10. F. Harary, Graph Theory, Addison-Wesley, 1972. | MR 256911 | Zbl 0182.57702

11. R. M. Karp, A Survey of Parallel Algorithms for Shared-Memory Machines, Report No. UCB/CSD 88/408, University of California Berkeley, March 1988.

12. M. E. Luks, Isomorphism of Graphs of Bounded Valence Can Be Tested In Polynomial Time, Journal of Computer and System Sciences, Vol. 25, 1982, pp. 42-65. | MR 685360 | Zbl 0493.68064

13. G. Sabidussi, Vertex Transitive Graphs, Monatshefte für Mathematik, 68, 1964, pp. 426-438. | MR 175815 | Zbl 0136.44608