Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses

Dilip Sarkar, Narsingh Deo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

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 languageEnglish (US)
Title of host publicationSupercomputing - 1st International Conference, Proceedings
EditorsTheodore S. Papatheodorou, Constantine D. Polychronopoulos, Elias N. Houstis
PublisherSpringer Verlag
Pages970-984
Number of pages15
ISBN (Print)9783540189916
DOIs
StatePublished - Jan 1 1988
Externally publishedYes
Event1st International Conference on Supercomputing, 1987 - Athens, Greece
Duration: Jun 8 1987Jun 12 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume297 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other1st International Conference on Supercomputing, 1987
CountryGreece
CityAthens
Period6/8/876/12/87

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses'. Together they form a unique fingerprint.

Cite this