### Abstract

Parallel parenthesis-matching algorithm has in the past been used to design parallel algorithms for generation of computation tree forms and parsing. In this paper we present a parallel parenthesis-matching algorithm. A variant of binary search tree is constructed in parallel. The search tree is used to find the matching of each parenthesis. The algorithm takes O(log n) time on a (n / log n)-processor CREW-PRAM. We also present an O(log n)-time parallel algorithm for generation of random sequences of parentheses. These two algorithms can be used to design an O(log n)-time parallel algorithm for generation of a class of random permutations.

Original language | English (US) |
---|---|

Title of host publication | Supercomputing - 1st International Conference, Proceedings |

Editors | Theodore S. Papatheodorou, Constantine D. Polychronopoulos, Elias N. Houstis |

Publisher | Springer Verlag |

Pages | 970-984 |

Number of pages | 15 |

ISBN (Print) | 9783540189916 |

DOIs | |

State | Published - Jan 1 1988 |

Externally published | Yes |

Event | 1st International Conference on Supercomputing, 1987 - Athens, Greece Duration: Jun 8 1987 → Jun 12 1987 |

### Publication series

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

Volume | 297 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 1st International Conference on Supercomputing, 1987 |
---|---|

Country | Greece |

City | Athens |

Period | 6/8/87 → 6/12/87 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Supercomputing - 1st International Conference, Proceedings*(pp. 970-984). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 297 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-18991-2_57