A Parallel Algorithm for the Generation of Words

  • Laurent Alonso
  • René Schott
Chapter

Abstract

A parallel algorithm is presented for generating a permutation of size n. The algorithm uses O(n) processors and runs in O(Log 2(n)) time. We show also that this algorithm permits the generation of a Dyck word. The same techniques work for Motzkin words, left factors of Dyck, Motzkin words and words of the language ε (see Chapter 5).

Keywords

Sorting 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1995

Authors and Affiliations

  • Laurent Alonso
    • 1
  • René Schott
    • 1
  1. 1.CRINUniversité Henri PoincaréFrance

Personalised recommendations