The design and analysis of computer algorithms ll, 1974. ,
Efficient Parallel Algorithms for String Editing and Related Problems, ProceedinglJ of the 26·th Allerton Conference on Communications, Control and Computing, Monticello, Ill, 1988. ,
DOI : 10.1137/0219066
Optimal canonization of all substrings of a string, Also, Information and Computation, 1989. ,
DOI : 10.1016/0890-5401(91)90016-U
URL : https://hal.archives-ouvertes.fr/hal-00619182
Parallel construction of a suffix tree with applications, Algorithmica, vol.4, issue.1-4, pp.347-365, 1988. ,
DOI : 10.1007/BF01762122
Highly parallelizable problems, Proceedings of the twenty-first annual ACM symposium on Theory of computing , STOC '89, pp.309-319, 1989. ,
DOI : 10.1145/73007.73036
Optimal Bounds for Decision Problems on the CRCW PRAM, Journal of the ACM, vol.963, pp.643-670, 1989. ,
Free Differential Calculus, IV. The Quotient Groups of the Lower Central Series, The Annals of Mathematics, vol.68, issue.1, pp.81-95, 1958. ,
DOI : 10.2307/1970044
Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays, Theoretical Computer Science, vol.88, issue.1, 1989. ,
DOI : 10.1016/0304-3975(91)90073-B
URL : https://hal.archives-ouvertes.fr/hal-00619586
Factorizing words over an ordered alphabet, Journal of Algorithms, vol.4, issue.4, pp.363-381, 1983. ,
DOI : 10.1016/0196-6774(83)90017-2
Relations between Concurrent-write Models of Parallel Computation, Proceeding8 of the 9-rd A eM Symp08ioum on Principle8 of Di8tributed Computing, pp.179-184, 1984. ,
Optimal parallel algorithms for string matching, Information and Control, vol.67, issue.1-3, pp.144-157, 1985. ,
DOI : 10.1016/S0019-9958(85)80031-0
URL : http://doi.org/10.1016/s0019-9958(85)80031-0
Combinatoric8 on Word, 1982. ,
Fast canonization of circular strings, Journal of Algorithms, vol.2, issue.2, pp.107-121, 1981. ,
DOI : 10.1016/0196-6774(81)90013-4