A coarse-grained multicomputer algorithm for the longest repeated suffix ending at each point in a word

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2668, Issue , 2003, Pages 239-248

  Garcia, Thierry ^a   Semé, David ^a  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COARSE GRAINED MULTICOMPUTER ALGORITHMS;

ALGORITHMS;

EID: 35248826989     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44843-8_26     Document Type: Article

References (15)

1. P. Bose, A. Chan, F. Dehne, and M. Latzel. Coarse grained parallel maximum matching in convex bipartite graph. Proc. 13th International Parallel Processing Symposium (IPPS'99), pages 125-129, 1999.
2. A. Chan and F. Dehne. A note on coarse grained parallel integer sorting. Parallel Processing Letters, 9(4):533-538, 1999.
3. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. Von Eicken. LogP:towards a realistic model of parallel computation. 4-th ACM SIGPLAN Symp. on Principles and Practices of Parallel Programming, pages 1-12, 1996.
4. F. Dehne, X. Deng, P. Dymond, A. Fabri, and A. Khokhar. A randomized parallel 3d convex hull algorithm for coarse grained multicomputers. Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, pages 27-33, 1995.
5. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379-400, 1996.
6. M. Diallo, A. Ferreira, A. Rau-Chaplin, and S. Ubeda. Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers. Journal of Parallel and Distributed Computing, 56(1):47-70, 1999.
7. A. Ferreira and N. Schabanel. A randomized bsp/cgm algorithm for the maximal independant set problem. Parallel Processing Letters, 9(3):411-422, 1999.
8. T. Garcia, J.F. Myoupo, and D. Semé. A work-optimal cgm algorithm for the longest increasing subsequence problem. International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'01), 2001.
9. T. Garcia, J.F. Myoupo, and D. Semé. A coarse-grained multicomputer algorithm for the longest common subsequence problem. 11-th Euromicro Conference on Parallel Distributed and Network based Processing (PDP'03), 2003.
10. M. Goudreau, S. Rao K. Lang, T. Suel, and T. Tsantilas. Towards efficiency and portability: Programming with the bsp model. 8th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA'96), pages 1-12, 1996.
11. S.R. Kim and K. Park. Fully scalable fault-tolerant simulations for bsp and cgm. Journal of Parallel and Distributed Computing, 60:1531-1560, 2000.
12. T. Lecroq, J.-F. Myoupo, and D. Semé. Exact computations of the longest repeated suffix ending at each point in a word. In R. Gantenbein and S. Shin, editors, Proceedings of the 17th International Conference on Computers and Their Applications, pages 18-21, 2002.
13. A. Lefebvre and T. Lecroq. Computing repeated factors with a factor oracle. In L. Brankovic and J. Ryan, editors, Proceedings of the 11th Australasian Workshop On Combinatorial Algorithms, pages 145-158, 2000.
14. W. F. Smyth. Repetitive perhaps, but not boring. Theor. Comput. Sci., 249(5):343-355, 2000.
15. L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.