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 Citations (Scopus)

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

Fingerprint

Parallel algorithms
Parallel Algorithms
Matching Algorithm
Trees (mathematics)
Binary Search Tree
Random Permutation
Random Sequence
Search Trees
Parsing
Design

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Sarkar, D., & Deo, N. (1988). Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses. In T. S. Papatheodorou, C. D. Polychronopoulos, & E. N. Houstis (Eds.), 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

Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses. / Sarkar, Dilip; Deo, Narsingh.

Supercomputing - 1st International Conference, Proceedings. ed. / Theodore S. Papatheodorou; Constantine D. Polychronopoulos; Elias N. Houstis. Springer Verlag, 1988. p. 970-984 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 297 LNCS).

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

Sarkar, D & Deo, N 1988, Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses. in TS Papatheodorou, CD Polychronopoulos & EN Houstis (eds), Supercomputing - 1st International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 297 LNCS, Springer Verlag, pp. 970-984, 1st International Conference on Supercomputing, 1987, Athens, Greece, 6/8/87. https://doi.org/10.1007/3-540-18991-2_57
Sarkar D, Deo N. Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses. In Papatheodorou TS, Polychronopoulos CD, Houstis EN, editors, Supercomputing - 1st International Conference, Proceedings. Springer Verlag. 1988. p. 970-984. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-18991-2_57
Sarkar, Dilip ; Deo, Narsingh. / Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses. Supercomputing - 1st International Conference, Proceedings. editor / Theodore S. Papatheodorou ; Constantine D. Polychronopoulos ; Elias N. Houstis. Springer Verlag, 1988. pp. 970-984 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{972fcca58ec741fcb47d100498daed98,
title = "Parallel algorithms for parenthesis matching and generation of random balanced sequences of parentheses",
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.",
author = "Dilip Sarkar and Narsingh Deo",
year = "1988",
month = "1",
day = "1",
doi = "10.1007/3-540-18991-2_57",
language = "English (US)",
isbn = "9783540189916",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "970--984",
editor = "Papatheodorou, {Theodore S.} and Polychronopoulos, {Constantine D.} and Houstis, {Elias N.}",
booktitle = "Supercomputing - 1st International Conference, Proceedings",
address = "Germany",

}

TY - GEN

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

AU - Sarkar, Dilip

AU - Deo, Narsingh

PY - 1988/1/1

Y1 - 1988/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84942209893&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84942209893&partnerID=8YFLogxK

U2 - 10.1007/3-540-18991-2_57

DO - 10.1007/3-540-18991-2_57

M3 - Conference contribution

SN - 9783540189916

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

SP - 970

EP - 984

BT - Supercomputing - 1st International Conference, Proceedings

A2 - Papatheodorou, Theodore S.

A2 - Polychronopoulos, Constantine D.

A2 - Houstis, Elias N.

PB - Springer Verlag

ER -