@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}, pages = {85--95}, publisher = {EDP-Sciences}, volume = {27}, number = {2}, year = {1993}, mrnumber = {1217679}, zbl = {0770.68034}, language = {en}, url = {http://www.numdam.org/item/ITA_1993__27_2_85_0/} }
TY - JOUR AU - Georgakopoulos, G. AU - Stafylopatis, A. TI - An approach to parallel algorithm design JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications PY - 1993 SP - 85 EP - 95 VL - 27 IS - 2 PB - EDP-Sciences UR - http://www.numdam.org/item/ITA_1993__27_2_85_0/ LA - en ID - ITA_1993__27_2_85_0 ER -
%0 Journal Article %A Georgakopoulos, G. %A Stafylopatis, A. %T An approach to parallel algorithm design %J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications %D 1993 %P 85-95 %V 27 %N 2 %I EDP-Sciences %U http://www.numdam.org/item/ITA_1993__27_2_85_0/ %G en %F 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, Volume 27 (1993) no. 2, pp. 85-95. http://www.numdam.org/item/ITA_1993__27_2_85_0/
1. Scheduling Dags to Minimize Time and Communication, Aegian Workshop on Computing (AWOC), Corfu, June 1988. | MR
, and ,2. The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974. | MR | Zbl
, and ,3. The Design and Analysis of Parallel Algorithms, Prentice-Hall, 1989. | Zbl
,4. Algebraic Graph Theory, Cambridge University Press, 1974. | MR | Zbl
,5. Does Co-NP Have Short Interactive Proofs?, Information Processing Letters, Vol. 25, 1987, pp. 27-32. | MR | Zbl
, and ,6. Operating Systems Theory, Prentice-Hall, 1973.
and ,7. E. G. COFFMAN (Editor), Computer and Job-shop Scheduling Theory, John Wiley, 1976. | MR | Zbl
8. Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Co., San Francisco, 1979. | MR | Zbl
and ,9. Scheduling Processor Bound Systems, Report No CS-76-036, Washington State University, 1976.
,10. Graph Theory, Addison-Wesley, 1972. | MR | Zbl
,11. A Survey of Parallel Algorithms for Shared-Memory Machines, Report No. UCB/CSD 88/408, University of California Berkeley, March 1988.
,12. 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 | Zbl
,13. Vertex Transitive Graphs, Monatshefte für Mathematik, 68, 1964, pp. 426-438. | MR | Zbl
,