Two optimal parallel algorithms on the commutation class of a word

Theoretical Computer Science

Volumn 324, Issue 1, 2004, Pages 107-131

  Schott, René ^a   Spehner, Jean Claude ^b  

^a LORIA   (France)

^b UNIVERSITÉ DE HAUTE ALSACE   (France)

Author keywords

Automaton; Commutation class; Optimal; Parallel algorithm; Partially commutative monoid

Indexed keywords

ASYMPTOTIC STABILITY; AUTOMATA THEORY; COMPUTATIONAL METHODS; CONCURRENT ENGINEERING; PARALLEL ALGORITHMS; PROBLEM SOLVING;

AUTOMATON; COMMUTATION CLASS; OPTIMAL; PARTIALLY COMMUTATIVE MONOID;

COMPUTER SCIENCE;

EID: 4344714977     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.048     Document Type: Conference Paper

References (14)

1. Cartier P., Foata D. Problèmes combinatoires de commutation et de réarrangements. Lecture Notes in Mathematics. Vol. 85:1969;Springer, Berlin.
2. C. Cérin, Automatic parallelization of programs with tools of trace theory, Proc. 6th Internat. Parallel Processing Symp. (IPPS), IEEE Press, New York, 1992, pp. 374-379.
3. C. Cérin, Application de la théorie des traces à l'implantation et à la mesure d'algorithmes de distribution, Thèse Université Paris 11, Centre d'Orsay, 1993.
4. C. Cérin, A. Petit, Speedup of recognizable languages, Proc. MFCS'93, Lecture Notes in Computer Science, Vol. 711, Springer, Berlin, 1993, pp. 332-341.
5. Cori R., Perrin D. Automates et commutations partielles. RAIRO Inform. Theor. 19:1985;21-32.
6. Diekert V. Combinatorics of traces. Lecture Notes in Computer Science. Vol. 454:1990;Springer, Berlin.
7. Hillis H.D., Steele G.L. Jr. Data parallel algorithms. Commun. ACM. 29(12):1986;1170-1183.
8. Jájá J. An Introduction to Parallel Algorithms. 1992;Addison-Wesley, Reading, MA.
9. Ladner R.E., Fischer M.J. Parallel prefix computation. J. ACM. 27(4):1980;831-838.
10. A. Mazurkievitch, Concurrent program schemes and their interpretations, DQIMI Report, PB 78, Aarhus University, 1977.
11. K. Mehlhorn, Data Structures and Algorithms, Vol. 1, Springer, Berlin, 1984.
12. Schott R., Spehner J.C. Efficient generation of commutation classes. J. Comput. Inform. 2(1):1996;1110-1132. (special issue: Proc. Eighth Internat. Conf. of Computing and Information (ICCI'96), Waterloo, Canada, June 19-22, 1996).
13. Schott R., Spehner J.C. Efficient generation of commutation classes. J. Comput. Inform. 2(1):1996;1110-1132. (special issue: Proc. Eighth Internat. Conf. of Computing and Information (ICCI'96), Waterloo, Canada, June 19-22, 1996).
14. Zielonka W. Notes on finite asynchronous automata and trace languages. RAIRO Inform. Theor. 21:1987;99-135.