CiteSeer.IST Home   Check: The following citations are predicted to all refer to the same paper.   Details

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. of ICALP'97, pages 131--143. Lecture Notes in Computer Science. Springer-Verlag, 1997.

E. C'aceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S.W. Song, "Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP,", on-line Postscript at http://www.scs.carleton.ca/scs/faculty/dehne.html.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Annual International Colloquium on Automata, Languages and Programming (ICALP), 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S.W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Annual International Colloquium on Automata, Languages and Programming (ICALP), 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. ICALP, LNCS 1256, pp. 390-400, 1997.

C ACERES, E., DEHNE, F., FERREIRA, A., FLOCCHINI, P., RIEPING, I., RONCATO, A., SANTORO, N., AND SONG, S. W. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. 24th International Colloquium on Automata, Languages and Programming. LNCS Vol. 1256 (1997), Springer-Verlag, pp. 390--400.

E. C'aceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proceedings of International conference on Automata, Languages, and Programming, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncaa, P. Flocchini, I. Rieping, A. Roncato, N.Santoro, S. W. Song, Efficient parallel graph algorithms for coarse grained multicomputers and BSP , ICALP 97, Bologna, Italy, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In P. Degano, R. Gorrieri, and A. Marchetti-Spaccam ela, editors, Proc. of ICALP'97, volume 1256 of LNCS, pages 390--400. Springer-Verlag, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. ICALP, LNCS 1256, pp. 390-400, 1997.

Caceres E., Dehne F., Ferreira A., Flocchini P., Rieping I., Roncato A., Santoro N., Song S.W., Efficient Parallelgraphs Algorithms for Coarse Grained Mulicomputers. 24 th Inter. Coll. ICALP'97, Automata Languages and Programs, LNCS 1256, Degano, Gorrieri, Marchetti-Spaccamela Eds, 1997.

E. C'aceres, F. Dehne, A. Ferreira, P. Flocchini, I. Reiping, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In Proc. Int. Colloquium Algorithms, Languages and Programming, LNCS 1256, pages 390--400, 1997.

E. C'aceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proceedings of International conference on Automata, Languages, and Programming, 1997.

Caceres, E., F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, S.W. Song, `Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP,' Proc. 24th International Colloquium on Automata Languages and Programming, LNCS 1256, pp. 390--400, Springer-Verlag, 1997.

CACERES, E., DEHNE, F., FERREIRA, A., FLOCCHINI, P., RIEPING, I., RONCATO, A., SANTORO, N., AND SONG, S. W. Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP. In Proc. 24th International Colloquium on Automata, Languages and Programming (1997), pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, "Efficient parallel graph algorithms for coarse grained multicomputers and BSP," in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390--400.

C ACERES, E., DEHNE, F., FERREIRA, A., FLOC- CHINI, P., REIPING, I., SANTORO, N., AND SONG, S. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In Proc. Int. Colloquium Algorithms, Languages and Programming, LNCS 1256 (1997), pp. 390--400.

C' aceres, E., Dehne, F., Ferreira, A., Flocchini, P., Reiping, I., Santoro, N., and Song, S. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In Proc. Int. Colloquium Algorithms, Languages and Programming, LNCS 1256 (1997), pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. of Intern. Colloquium on Automata, Languages, and Programming (ICALP), pages 390 -- 400, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. lieping, A. loncato, N. Santoro, and S. Song. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In P. Degano, 1. Gorrieri, and A. Marchetti-Spaccamela, editors, Proceedings of ICALP'97, volume 1256 of Lecture Notes in Computer Science, pages 390-400. Springer-Verlag, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, Efficient parallel graph algorithms for coarse grained multicomputers and BSP, in: P. Degano, R. Gorrieri and A. Marchetti-Spaccamela, eds., Proceedings ICALP '97 - 24th International Colloquium on Automata, Languages, and Programming, Lecture Notes in Computer Science, V. 1256 (1997) 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. 24th Int'l Colloquium on Automata, Languages and Programming (ICALP'97), volume 1256 of Lecture Notes in Computer Science, pages 390--400, Bologna, Italy, 1997. Springer-Verlag.

F. Dehne, A. Ferreira, E. Caceres, S. W. Song, and A. Roncato. Efficient parallel graph algorithms for coarse-grained multicomputers and BSP. Algorithmica, 33:183--200, 2002.

E. Caceres, F. Dehne, A. Ferreira, P. Locchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In The 24th International Colloquium on Automata Languages and Programming, volume 1256 of LNCS, pages 390--400. Springer Verlag, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro and S.W. Song, Efficient Parallel Graph Algorithms For Coarse Grained Multicomputers and BSP, in Proceedings ICALP '97 - 24th International Colloquium on Automata, Languages, and Programming, P. Degano and R. Gorrieri and A. Marchetti-Spaccamela (Eds.), 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, "Efficient parallel graph algorithms for coarse grained multicomputers and BSP," in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Reiping, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. International Colloquium Algorithms, Languages and Programming, pages 390--400. LNCS 1256, Springer-Verlag, Berlin, 1997.

Caceres E, Dehne F, Ferreira A, Flocchini P, Rieping I, Roncato A, Santoro N, Song S. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. Proceedings of ICALP'97 (Lecture Notes in Computer Science, vol. 1256). Springer: Berlin, 1997; 131--143.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP, Proc.24th International Colloquium on Automata, Languages and Programming (ICALP '97), Lecture Notes in Computer Science, Vol. 1256, Springer-Verlag, Berlin, 1997, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, "Efficient parallel graph algorithms for coarse grained multicomputers and BSP," in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, "Efficient parallel graph algorithms for coarse grained multicomputers and BSP," in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Italy, 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390-400. 12

C ACERES, E., DEHNE,F.,FERREIRA,A.,FLOC- CHINI,P.,REIPING,I.,SANTORO,N.,AND SONG, S. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In Proc. Int. Colloquium Algorithms, Languages and Programming, LNCS 1256 (1997), pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Reiping, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. Internat. Colloquium on Algorithms, Languages and Programming, pages 390--400. LNCS 1256. Springer-Verlag, Berlin, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song. Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP. In Proc. 24th International Colloquium on Automata, Languages and Programming, 1997, 390-400.

C ACERES, E., DEHNE,F.,FERREIRA,A.,FLOC- CHINI,P.,REIPING,I.,SANTORO,N.,AND SONG, S. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In Proc. Int. Colloquium Algorithms, Languages and Programming, LNCS 1256 (1997), pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, "Efficient parallel graph algorithms for coarse grained multicomputers and BSP," in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP, Proc.24th International Colloquium on Automata, Languages and Programming (ICALP '97), Lecture Notes in Computer Science, Vol. 1256, Springer-Verlag, Berlin, 1997, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Reiping, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. International Colloquium Algorithms, Languages and Programming, pages 390--400. LNCS 1256, Springer-Verlag, Berlin, 1997.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP, Proc.24th International Colloquium on Automata, Languages and Programming (ICALP '97), Lecture Notes in Computer Science, Vol. 1256, Springer-Verlag, Berlin, 1997, pp. 390--400.

C ACERES, E., DEHNE,F.,FERREIRA,A.,FLOC- CHINI,P.,REIPING,I.,SANTORO,N.,AND SONG, S. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In Proc. Int. Colloquium Algorithms, Languages and Programming, LNCS 1256 (1997), pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, "Efficient parallel graph algorithms for coarse grained multicomputers and BSP," in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Reiping, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. International Colloquium Algorithms, Languages and Programming, pages 390--400. LNCS 1256, Springer-Verlag, Berlin, 1997.

F. Dehne, A. Ferreira, E. Caceres, S.W. Song, and A. Roncato. Efficient parallel graph algorithms for coarse-grained multicomputers and BSP. Algorithmica, 33(2):183--200, 2002.

F. Dehne, A. Ferreira, E. Caceres, S.W. Song, and A. Roncato. Efficient parallel graph algorithms for coarse-grained multicomputers and BSP. Algorithmica, 33(2):183--200, 2002.

C ACERES, E., DEHNE,F.,FERREIRA,A.,FLOC- CHINI,P.,REIPING,I.,SANTORO,N.,AND SONG, S. Efficient parallel graph algorithms for coarse grained multicomputers and bsp. In Proc. Int. Colloquium Algorithms, Languages and Programming, LNCS 1256 (1997), pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, "Efficient parallel graph algorithms for coarse grained multicomputers and BSP," in Proc. 24th International Colloquium on Automata, Languages and Programming (ICALP'97), 1997, Springer Verlag Lecture Notes in Computer Science, Vol. 1256, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Rieping, A. Roncato, N. Santoro, and S. W. Song, Efficient Parallel Graph Algorithms for Coarse Grained Multicomputers and BSP, Proc.24th International Colloquium on Automata, Languages and Programming (ICALP '97), Lecture Notes in Computer Science, Vol. 1256, Springer-Verlag, Berlin, 1997, pp. 390--400.

E. Caceres, F. Dehne, A. Ferreira, P. Flocchini, I. Reiping, N. Santoro, and S. W. Song. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. In Proc. International Colloquium Algorithms, Languages and Programming, pages 390--400. LNCS 1256, Springer-Verlag, Berlin, 1997.

CiteSeer.IST - Copyright Penn State and NEC