Author:
Lima Anderson C.,Branco Rodrigo G.,Ferraz Samuel,Cáceres Edson N.,Gaioso Roussian A.,Martins Wellington S.,Song Siang W.
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. Alves CER, Cáceres EN, Song SW (2004) BSP/CGM algorithms for maximum subsequence and maximum subarray In: Recent Advances in Parallel Virtual Machine and Message Passing Interface, volume 3241 of Lecture Notes in Computer Science, 139–146.. Springer, Berlin Heidelberg.
2. Bentley J (1984) Programming pearls: algorithm design techniques. Commun ACM 27(9): 865–873.
3. Dehne F, Fabri A, Rau-chaplin A (1994) Scalable parallel computational geometry for coarse grained multicomputers. Int J Comput Geom 6: 298–307.
4. Dehne F, Ferreira A, Cáceres EN, Song SW, Roncato A (2002) A efficient parallel graph algorithms for coarse grained multicomputers and BSP. Algorithmica 33(2): 183–200.
5. Denning PJ (1968) Thrashing: its causes and prevention In: Proceedings of the December 9-11, 1968, Fall Joint Computer Conference, Part I. AFIPS ’68 (Fall, part I), 915–922.. ACM, New York. doi:
http://dx.doi.org/10.1145/1476589.1476705
.